{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:46:13Z","timestamp":1726029973433},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961538"},{"type":"electronic","value":"9783319961545"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-319-96154-5_18","type":"book-chapter","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:09:17Z","timestamp":1558703357000},"page":"141-146","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Toward Distributed Computability Theory"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Gorrieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,25]]},"reference":[{"unstructured":"H.P. Barendregt, The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103 (revised ed.) (North Holland, Amsterdam, 1984)","key":"18_CR1"},{"doi-asserted-by":"crossref","unstructured":"H. Beki\u010d, The semantics of parallel processing, in Programming Languages and Their Definition - Hans Beki\u010d (1936\u20131982), ed. by C.B. Jones. Lecture Notes in Computer Science, vol. 177 (Springer, Berlin, 1984), pp. 215\u2013229","key":"18_CR2","DOI":"10.1007\/BFb0048946"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01178506","volume":"28","author":"E Best","year":"1991","unstructured":"E. Best, R. Devillers, A. Kiehn, L. Pomello, Concurrent bisimulations in Petri nets. Acta Inform. 28(3), 231\u2013264 (1991)","journal-title":"Acta Inform."},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"A Church","year":"1936","unstructured":"A. Church, An unsolvable problem of elementary number theory. Am. J. Math. 58(2), 345\u2013363 (1936)","journal-title":"Am. J. Math."},{"volume-title":"The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions","year":"1965","unstructured":"M. Davis (ed.), The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions (Raven Press, Hewlett, 1965)","key":"18_CR5"},{"key":"18_CR6","volume-title":"Computability, Complexity and Languages","author":"MD Davis","year":"1983","unstructured":"M.D. Davis, E.J. Weyuker, Computability, Complexity and Languages (Academic, New York, 1983)"},{"issue":"1\u20132","key":"18_CR7","doi-asserted-by":"publisher","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 C\/E systems. Acta Inform. 26(1\u20132), 59\u201391 (1988)","journal-title":"Acta Inform."},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"EW Dijkstra","year":"1971","unstructured":"E.W. Dijkstra, Hierarchical ordering of sequential processes. Acta Inform. 1(2), 115\u2013138 (1971)","journal-title":"Acta Inform."},{"key":"18_CR9","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55559-1","volume-title":"Process Algebras for Petri Nets","author":"Roberto Gorrieri","year":"2017","unstructured":"R. Gorrieri, Process Algebras for Petri Nets: The Alphabetization of Distributed Systems. EATCS Monographs in Theoretical Computer Science (Springer, Berlin, 2017)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.3233\/FI-2017-1557","volume":"154","author":"R Gorrieri","year":"2017","unstructured":"R. Gorrieri, CCS(25,12) is Turing-complete. Fund. Inform. 154(1), 145\u2013166 (2017)","journal-title":"Fund. Inform."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.jlamp.2017.11.005","volume":"96","author":"R Gorrieri","year":"2018","unstructured":"R. Gorrieri, Verification of finite-state machines: a distributed approach. J. Logic Algebraic Methods Program. 96, 65\u201380 (2018)","journal-title":"J. Logic Algebraic Methods Program."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-21491-7","volume-title":"Introduction to Concurrency Theory","author":"Roberto Gorrieri","year":"2015","unstructured":"R. Gorrieri, C. Versari, Introduction to Concurrency Theory: Transition Systems and CCS. EATCS Texts in Theoretical Computer Science (Springer, Berlin, 2015)"},{"unstructured":"C.A.R. Hoare, Communicating Sequential Processes (Prentice Hall, Upper Saddle River, 1985)","key":"18_CR13"},{"key":"18_CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"2001","unstructured":"J.E. Hopcroft, R. Motwani, J.D. Ullman. Introduction to Automata Theory, Languages and Computation, 2nd edn. (Addison-Wesley, Boston, 2001)","edition":"2"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1090\/S0002-9947-1943-0007371-8","volume":"53","author":"SC Kleene","year":"1943","unstructured":"S.C. Kleene, Recursive predicates and quantifiers. Trans. Am. Math. Soc. 53(1), 41\u201373 (1943)","journal-title":"Trans. Am. Math. Soc."},{"unstructured":"R. Milner, Communication and Concurrency (Prentice Hall, Upper Saddle River, 1989)","key":"18_CR16"},{"unstructured":"M.L. Minsky, Computation: Finite and Infinite Machines (Prentice Hall, Upper Saddle River, 1967)","key":"18_CR17"},{"unstructured":"J.L. Peterson, Petri Net Theory and the Modeling of Systems (Prentice Hall, Upper Saddle River, 1981)","key":"18_CR18"},{"key":"18_CR19","volume-title":"Kommunikation mit Automaten","author":"CA Petri","year":"1962","unstructured":"C.A. Petri, Kommunikation mit Automaten. Ph.D. Dissertation, University of Bonn, 1962"},{"key":"18_CR20","first-page":"410","volume-title":"Lecture Notes in Computer Science","author":"L. Pomello","year":"1992","unstructured":"L. Pomello, G. Rozenberg, C. Simone, A survey of equivalence notions for net based systems, in Advances in Petri Nets: The DEMON Project, ed. by G. Rozenberg. Lecture Notes in Computer Science, vol. 609, pp. 410\u2013472 (Springer, Berlin, 1922)"},{"key":"18_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33278-4","volume-title":"Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies","author":"W Reisig","year":"2013","unstructured":"W. Reisig, Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies (Springer, Berlin, 2013)"},{"key":"18_CR22","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers Jr","year":"1987","unstructured":"H. Rogers Jr., Theory of Recursive Functions and Effective Computability (MIT Press, Cambridge, 1987) (original edition published by McGraw-Hill, 1967)"},{"issue":"1","key":"18_CR23","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"s2-42","author":"A. M. Turing","year":"1937","unstructured":"A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, in Proceedings of the London Mathematical Society. Series 2, vol. 42 (1936), pp. 230\u2013265","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"6","key":"18_CR24","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1017\/S0960129509990168","volume":"19","author":"C Versari","year":"2009","unstructured":"C. Versari, N. Busi, R. Gorrieri. An expressiveness study of priority in process calculi. Math. Struct. Comput. Sci. 19(6), 1161\u20131189 (2009)","journal-title":"Math. Struct. Comput. Sci."}],"container-title":["Carl Adam Petri: Ideas, Personality, Impact"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96154-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:19:03Z","timestamp":1558703943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96154-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783319961538","9783319961545"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96154-5_18","relation":{},"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}