{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:42:00Z","timestamp":1778298120344,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540678977","type":"print"},{"value":"9783540446187","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44618-4_23","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:38:51Z","timestamp":1188297531000},"page":"305-319","source":"Crossref","is-referenced-by-count":21,"title":["A Theory of Testing for Markovian Processes"],"prefix":"10.1007","author":[{"given":"Marco","family":"Bernardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"key":"23_CR1","unstructured":"M. Bernardo, \u201cTheory and Application of Extended Markovian Process Algebra\u201d, Ph.D. Thesis, University of Bologna, 1999 \n                    (http:\/\/www.di.unito.it\/~bernardo\/)"},{"key":"23_CR2","unstructured":"M. Bernardo, W. R. Cleaveland, \u201cA Theory of Efficiency for Markovian Processes\u201d, Tech. Rep. UBLCS-99-02, University of Bologna, 1999"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"W. R. Cleaveland","year":"1993","unstructured":"W. R. Cleaveland, M. C. B. Hennessy, \u201cTesting Equivalence as a Bisimulation Equivalence\u201d, in Formal Aspects of Computing 5:1\u201320, 1993","journal-title":"Formal Aspects of Computing"},{"key":"23_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1007\/3-540-55719-9_116","volume-title":"Proc. of ICALP\u2019 92","author":"W. R. Cleaveland","year":"1992","unstructured":"W. R. Cleaveland, S. A. Smolka, A. E. Zwarico, \u201cTesting Preorders for Probabilistic Processes\u201d in Proc. of ICALP\u2019 92, LNCS 623:708\u2013719, 1992"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1983","unstructured":"R. De Nicola, M. C. B. Hennessy, \u201cTesting Equivalences for Processes\u201d in Theoretical Computer Science 34:83\u2013133, 1983","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","unstructured":"H. Hermanns, \u201cInteractive Markov Chains\u201d, Ph.D. Thesis, University of Erlangen, 1998"},{"key":"23_CR7","unstructured":"H. Hermanns, M. Rettelbach, \u201cSyntax, Semantics, Equivalences, and Axioms for MTIPP\u201d, in Proc. of PAPM\u2019 94, pp. 71\u201387, Erlangen, 1994"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"J. Hillston, \u201cA Compositional Approach to Performance Modelling\u201d Cambridge University Press, 1996","DOI":"10.1017\/CBO9780511569951"},{"key":"23_CR9","unstructured":"J. Hillston, \u201cExploiting Structure in Solution: Decomposing Composed Models\u201d, in Proc. of PAPM\u2019 98, pp. 1\u201315, 1998"},{"key":"23_CR10","unstructured":"R. A. Howard, \u201cDynamic Probabilistic Systems\u201d, John Wiley & Sons, 1971"},{"key":"23_CR11","unstructured":"M. F. Neuts, \u201cMatrix-Geometric Solutions in Stochastic Models-An Algorithmic Approach\u201d, John Hopkins University Press, 1981"},{"key":"23_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-60218-6_18","volume-title":"Proc. of CONCUR\u2019 95","author":"M. Nu\u00f1ez","year":"1995","unstructured":"M. Nu\u00f1ez, D. de Frutos, L. Llana, \u201cAcceptance Trees for Probabilistic Processes\u201d, in Proc. of CONCUR\u2019 95, LNCS 962:249\u2013263, 1995"},{"key":"23_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-540-48654-1_36","volume-title":"Proc. of CONCUR\u2019 94","author":"S. Yuen","year":"1994","unstructured":"S. Yuen, W. R. Cleaveland, Z. Dayar, S. A. Smolka, \u201cFully Abstract Characterizations of Testing Preorders for Probabilistic Processes\u201d, in Proc. of CONCUR\u2019 94, LNCS 836:497\u2013512, 1994"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2000 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44618-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T23:08:27Z","timestamp":1550876907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44618-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678977","9783540446187"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44618-4_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}