{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:30Z","timestamp":1725663690835},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512851"},{"type":"electronic","value":"9783540461845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51285-3_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:52:20Z","timestamp":1330203140000},"page":"73-88","source":"Crossref","is-referenced-by-count":8,"title":["Towards a theory of simulation for verification of concurrent systems"],"prefix":"10.1007","author":[{"given":"Ryszard","family":"Janicki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bertholet G. and Terrat R., Petri Net Theory for the Correctness of Protocols, IEEE Transactions on Communications, Vol. COM-30, 1982.","DOI":"10.1109\/TCOM.1982.1095452"},{"key":"6_CR2","volume-title":"Concurrent Behaviour: Sequences, Processes and Programming Languages","author":"E. Best","year":"1985","unstructured":"Best E. and Devillers R., Concurrent Behaviour: Sequences, Processes and Programming Languages, GMD-Studien Nr. 99, GMD, Bonn, 1985."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Billington J., Wheeler G.R. and Wilbur-Ham M.C., PROTEAN: A High-Level Net Tool for the Specification and Verification of Communication Protocols, IEEE Transactions on Software Engineering, Vol. 14, No.3, 1988.","DOI":"10.1109\/32.4651"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes S.D., Hoare C.A.R. and Roscoe A.W., A Theory of Communicating Sequential Processes, JACM, Vol.31, 1984, pp.560\u2013599.","journal-title":"JACM"},{"key":"6_CR5","unstructured":"Browne M.C., An Improved Algorithm for the Automatic Verification of Finite State Systems using Temporal Logic, Report, CMU-CS-86-156, Carnegie-Mellon University, 1986."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke E.M., Emerson E.A. and Sistla A.P., Automatic Verification of Finite-State Systems using Temporal Logic Specifications, TOPLAS, Vol.8, 1986, pp.244\u2013263.","journal-title":"TOPLAS"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Gostelow K. et. al, Proper Termination of Flow Control in Programs Involving Concurrent Processes, SIGPLAN Notices, Vol.7, No.11, 1972.","DOI":"10.1145\/987361.987365"},{"key":"6_CR8","unstructured":"Hack M., Analysis of Production Schemata by Petri Nets, MIT, MAC, Comp. Stru. Note 17, 1974."},{"key":"6_CR9","first-page":"136","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy M. and Milner R., Algebraic Laws for Nondeterminism and Concurrency, JACM, Vol.32, 1985, pp.136\u2013161.","journal-title":"JACM"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hoare C.A.R., Communicating Sequential Processes, Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Holzmann G.J., Automated Protocol Verification and Automatic Implementation of Communication Protocols, IEEE Transactions on Software Engineering, Vol. SE-12, No.8, 1986.","DOI":"10.1109\/TSE.1986.6312985"},{"key":"6_CR12","unstructured":"Inmos Ltd., occam Programming Manual, Prentice-Hall, 1985."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(84)90014-8","volume":"29","author":"R. Janicki","year":"1984","unstructured":"Janicki R., Nets, Sequential Components and Concurrency Relations, Theoretical Computer Science 29 (1984), pp. 87\u2013121.","journal-title":"Theoretical Computer Science"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0304-3975(86)90177-5","volume":"43","author":"R. Janicki","year":"1986","unstructured":"Janicki R., Lauer P.E., Koutny M., Devillers R., Concurrent and Maximally Concurrent Evolution of Non-Sequential Systems, Theoretical Computer Science 43(1986), pp. 213\u2013238.","journal-title":"Theoretical Computer Science"},{"issue":"7","key":"6_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"Keller R.M., Formal Verification of Concurrent Programs, CACM, Vol.19, No.7, pp.371\u2013384, 1976.","journal-title":"CACM"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-50403-6_51","volume":"335","author":"M. Koutny","year":"1988","unstructured":"Koutny M., Adequacy-Preserving Transformations of COSY Path Programs, in: Concurrency 88, F.H. Vogt (Ed.), Lecture Notes in Computer Science, vol.335, 368\u2013379, 1988.","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR17","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"Lallement G., Semigroups and Combinatorial Applications, J. Wiley & Sons, New York 1979."},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-10699-5_95","volume":"107","author":"P.E. Lauer","year":"1981","unstructured":"Lauer P.E., Shields M.W., Cotronis J.Y., Formal Behavioural Specification of Concurrent Systems without Globality Assumptions, Lecture Notes in Computer Science, vol. 107, Springer 1981, pp. 115\u2013151.","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Manna Z. and Pnueli A., How to Cook a Temporal Proof System for Your Pet Language, Proc. POPL'83, 1983.","DOI":"10.1145\/567067.567082"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Martinez J. and Silva M., \"A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net\", Proc. Second European Workshop on Application and Theory of Petri Nets, 1982.","DOI":"10.1007\/978-3-642-68353-4_47"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, Report DAIMI PB-78, Dept. of Computer Science, Aarhus Univ. Publ., 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Milner R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Morgan E.T and Razouk R.R., Interactive State-Space Analysis of Concurrent Systems, IEEE Transactions on Software Engineering, Vol. SE-13, No. 10, 1987.","DOI":"10.1109\/TSE.1987.232850"},{"key":"6_CR24","unstructured":"Murata T. and Suzuki I., On the Structural Properties Properties and Stepwise Refinment of Petri Nets, Proc. 24th Midwest Symposium on Circuit and Systems, 1981."},{"key":"6_CR25","unstructured":"Peterson J.L., Petri Net Theory and the Modeling of Systems, Prentice Hall, 1981."},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Pinter S.S. and Wolper P., A Temporal Logic to Reason about Partially Ordered Computations, Proc. 3rd ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, 1984, pp. 28\u201337.","DOI":"10.1145\/800222.806733"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Reisig W., Petri Nets, Springer 1985.","DOI":"10.1007\/978-3-642-69968-9"},{"key":"6_CR28","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-11160-3_6","volume":"125","author":"A. Salwicki","year":"1981","unstructured":"Salwicki A., M\u00fcldner T., On Algorithmic Properties of Concurrent Programs, Lecture Notes in Computer Science, vol. 125, Springer 1981, pp. 169\u2013197.","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR29","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BFb0022473","volume":"70","author":"M.W. Shields","year":"1979","unstructured":"Shields M.W., Adequate Path Expressions, Lecture Notes in Computer Science, vol. 70, Springer 1979, pp. 249\u2013265.","journal-title":"Lecture Notes in Computer Science"},{"issue":"5","key":"6_CR30","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"M.W. Shields","year":"1985","unstructured":"Shields M.W., Concurrent Machines, The Computer Journal 28,5(1985), pp. 449\u2013465.","journal-title":"The Computer Journal"},{"issue":"5","key":"6_CR31","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/69586.69587","volume":"26","author":"R.N. Taylor","year":"1983","unstructured":"Taylor R.N., A General-Purpose Algorithm for Analyzing Concurrent Programs, CACM, Vol. 26, No.5, pp. 362\u2013376, 1983.","journal-title":"CACM"},{"issue":"2","key":"6_CR32","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka W., Notes on Finite Asynchronous Automata, Informatique Th\u00e9orique et Applications, Vol. 21, No. 2, 1987, pp. 99\u2013135.","journal-title":"Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","PARLE '89 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51285-3_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:51:27Z","timestamp":1640919087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51285-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512851","9783540461845"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-51285-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}