{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:56:06Z","timestamp":1794336966534,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540510802","type":"print"},{"value":"9783540461470","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0013033","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:06:46Z","timestamp":1132708006000},"page":"508-522","source":"Crossref","is-referenced-by-count":2,"title":["A logic for distributed transition systems"],"prefix":"10.1007","author":[{"given":"K.","family":"Lodaya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Ramanujam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P. S.","family":"Thiagarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/0022-0000(82)90018-6","volume":"25","author":"M. Ben-Ari","year":"1982","unstructured":"Ben-Ari, M., Halpern, J.Y. and Pnueli, A. (1982): Deterministic Propositional Dynamic Logic: Finite Models, Complexity and Completeness. J. Comput. Syst. Sci., 25, pp. 402\u2013417.","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR2","unstructured":"Degano, P., De Nicola, R. and Montanari, U. (1987): A Distributed Operational Semantics for CCS based on Condition\/Event Systems. Nota Interna I.E.I. \u2014 B4 \u2014 21, Department of Computer Science, University of Pisa (To appear in Acta Informatica)."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J. and Ladner, R.E. (1979): Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci., 18, pp 194\u2013211.","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Hennessy, M. and Milner, R. (1980): On Observing Non-determinism and Concurrency, Springer Lecture Notes in Computer Science, 85, Springer-Verlag, pp 299\u2013309.","DOI":"10.1007\/3-540-10003-2_79"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ger, F. (1987): Temporal Logic of Programs. EATCS Monograph on Theoretical Computer Science, 8, Springer-Verlag.","DOI":"10.1007\/978-3-642-71549-5"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","volume":"14","author":"D. Kozen","year":"1982","unstructured":"Kozen, D. and Parikh, R. (1982): An Elementary Proof of Completeness of PDL. Theor. Comput. Sci., 14, pp 113\u2013118.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Lichtenstein, O., Pnueli, A. and Zuck, L. (1985): The Glory of the Past. In: Logic of Programs, Ed. R. Parikh, Springer Lecture Notes in Computer Science, 193, Springer-Verlag, pp 196\u2013218.","DOI":"10.1007\/3-540-15648-8_16"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Milner, R., (1980): A Calculus of Communicating Systems. Springer Lecture Notes in Computer Science, 92, Springer-Verlag.","DOI":"10.1007\/3-540-10235-3"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Olderog, E.-R. (1987): Operational Petri Net Semantics for CCSP. In: Advances in Petri Nets, Ed. G. Rozenberg, Springer Lecture Notes in Computer Science, 266, Springer-Verlag, pp 381\u2013400.","DOI":"10.1007\/3-540-18086-9_27"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Parikh, R. (1988): Decidability and Undecidability in Distributed Transition systems (Unpublished Manuscript).","DOI":"10.1142\/9789814368452_0011"}],"container-title":["Lecture Notes in Computer Science","Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:23:10Z","timestamp":1586564590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510802","9783540461470"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0013033","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0013019","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}