{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:58Z","timestamp":1725663838792},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:09:31Z","timestamp":1330258171000},"page":"20-31","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Equivalences and preorders of transition systems"],"prefix":"10.1007","author":[{"given":"A.","family":"Arnold","sequence":"first","affiliation":[]},{"given":"A.","family":"Dicky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"2_CR1","unstructured":"A. Arnold. Syst\u00e8mes de transitions finis et s\u00e9mantique des processus communicants. Masson, 1992."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0890-5401(89)90054-0","volume":"82","author":"A. Arnold","year":"1989","unstructured":"A. Arnold, A. Dicky. An Algebraic Characterization of Transition System Equivalences. Information and Computation, 82:198\u2013229, 1989.","journal-title":"Information and Computation"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90276-L","volume":"106","author":"G. Boudol","year":"1992","unstructured":"G. Boudol, K. Larsen. Graphical versus Logical Specifications. Theor. Comput. Sci.,106:3\u201320, 1992","journal-title":"Theor. Comput. Sci."},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02915446","volume":"26","author":"P. Degano","year":"1988","unstructured":"P. Degano, R. De Nicola, U. Montanari. A Distributed Operational Semantics for CCS Based on Condition\/Event Systems, Acta Informatica, 26:59\u201391, 1988.","journal-title":"Acta Informatica"},{"key":"2_CR5","unstructured":"R. De Nicola, F. Vaandrager. Three Logics for Branching Bisimulation. in: Proc. of LICS '90(1990)118\u2013129."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logics specifications. ACM Trans. Prog. Lang. Syst., 8:244\u2013263, 1986.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E. A. Emerson","year":"1986","unstructured":"E. A. Emerson and J. Y. Halpern. \u201cSometimes\u201d and \u201cNot Never\u201d revisited: on branching versus linear time temporal logic. J. Assoc. Comput. Mach., 33:151\u2013178, 1986.","journal-title":"J. Assoc. Comput. Mach."},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0019-9958(84)80047-9","volume":"61","author":"E. A. Emerson","year":"1984","unstructured":"E. A. Emerson and A. P. Sistla. Deciding full branching time logic. Information and Control, 61:175\u2013201, 1984.","journal-title":"Information and Control"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy, R.Milner. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach., 32:137\u2013161, 1985.","journal-title":"J. Assoc. Comput. Mach."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BFb0030311","volume":"176","author":"M. Hennessy","year":"1984","unstructured":"M. Hennessy, C. Stirling. The power of the future perfect in program logics. in: 11th Math. Foundations of Comput. Sci, 1984. Lect. Notes Comput. Sci. 176(1984)301\u2013311.","journal-title":"Lect. Notes Comput. Sci."},{"key":"2_CR11","unstructured":"K. Larsen, B. Thomsen. A Modal Process Logic. in: Proc. of LICS '88(1988)203\u2013210."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:07:33Z","timestamp":1558267653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}