{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:04Z","timestamp":1725467404420},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648963"},{"type":"electronic","value":"9783540684558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055623","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T07:31:00Z","timestamp":1153985460000},"page":"179-193","source":"Crossref","is-referenced-by-count":6,"title":["Possible worlds process algebras"],"prefix":"10.1007","author":[{"given":"Simone","family":"Veglioni","sequence":"first","affiliation":[]},{"given":"Rocco","family":"De Nicola","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"J. Baeten and W. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"12_CR2","unstructured":"J.A. Bergstra, J.W. Klop, and E.R. Olderog. Failures without chaos: A new process semantics for fair abstraction. In M.Wirsing, editor, Formal Description of Programming Concepts \u2014 III, pages 77\u2013103. North-Holland, 1987."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"R. De Nicola and M. Hennessy. CCS without \u03a4's. In Proceedings, TAPSOFT'87, Theory And Practice of SOFTware development, pages 138\u2013252. Springer-Verlag LNCS 249, 1987.","DOI":"10.1007\/3-540-17660-8_53"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Hartmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-69962-7"},{"key":"12_CR6","volume-title":"PhD thesis","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University, Amsterdam, 1990. Second edition available as CWI tract 109, CWI, Amsterdam 1996."},{"key":"12_CR7","unstructured":"Joseph A. Goguen. Theorem Proving and Algebra. MIT, 1997."},{"key":"12_CR8","unstructured":"Joseph A. Goguen and Grant Malcolm. A hidden agenda. Technical Report CS97-538, UCSD, 1997. To appear in Theoretical Computer Science."},{"key":"12_CR9","unstructured":"M. Hennessy. Algebraic theory of processes. MIT Press, 1988."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Fernando Orejas, Marisa Navarro, and Ana S\u00e1nchez. Algebraic implementation of abstract data-types: a survey of concepts and new compositionality results. Mathematical Structures in Computer Science, 6(1), 1996.","DOI":"10.1017\/S0960129500000864"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00283329","volume":"25","author":"D. Sannella","year":"1988","unstructured":"Donald Sannella and Andrzej Tarlecki. Toward formal development of programs from algebraic specifications. Acta Informatica, 25:233\u2013281, 1988.","journal-title":"Acta Informatica"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Rob van Glabbeek. The linear time \u2014 branching time spectrum. In J. Baeten and J. Klop, editors, Proceedings, CONCUR'90, Amsterdam, pages 278\u2013297. Springer-Verlag Lecture Notes in Computer Science, 458, 1990.","DOI":"10.1007\/BFb0039066"},{"key":"12_CR13","unstructured":"Simone Veglioni. Integrating Static and Dynamic aspects in the specification of Open Object-based Distributed Systems. PhD thesis, Programming Research Group, Oxford University, 1997. Available on ftp:\/\/ftp.univaq.it\/pub\/users\/veglioni\/thesis.ps."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Simone Veglioni. Objects as Abstract Machines. In Proceedings, Formal Methods for Open, Object-based, Distributed Systems, 2nd International Conference, FMOODS'97. Chapman & Hall, 1997.","DOI":"10.1007\/978-0-387-35261-9_19"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:28:58Z","timestamp":1555748938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0055623","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}