{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:10:42Z","timestamp":1737436242003,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430674"},{"type":"electronic","value":"9783540455417"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45541-8_11","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T10:55:33Z","timestamp":1187261733000},"page":"346-379","source":"Crossref","is-referenced-by-count":4,"title":["On Concurrent Realization of Reactive Systems and Their Morphisms"],"prefix":"10.1007","author":[{"given":"Marek A.","family":"Bednarczyk","sequence":"first","affiliation":[]},{"given":"Andrzej M.","family":"Borzyszkowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-65306-6_22","volume-title":"Advances in Petri Nets","author":"E. Badouel","year":"1998","unstructured":"E. Badouel and P. Darondeau. Theory of regions. In Advances in Petri Nets, vol. 1491 of LNCS, pp. 529\u2013586. Springer, 1998."},{"key":"11_CR2","unstructured":"E. Badouel, M. A. Bednarczyk and P. Darondeau. Generalized automata and their net representations. In this volume."},{"key":"11_CR3","series-title":"Ph.D. thesis","volume-title":"Categories of Asynchronous Systems","author":"M. A. Bednarczyk","year":"1988","unstructured":"M. A. Bednarczyk. Categories of Asynchronous Systems. Ph.D. thesis, University of Sussex, England, 1988. CST 1-88."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"M. A. Bednarczyk and A. M. Borzyszkowski. Concurrent realizations of reactive systems. In P. R. M. Hofmann, D. Pavlovic, ed., Proc. Category Theory in Computer Science, 8th Conf., Edinburgh, vol. 29 of Electronic Notes in Theoretical Computer Science, pp. 1\u201319. Elsevier, 1999.","DOI":"10.1016\/S1571-0661(05)80301-9"},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48523-6_16","volume-title":"Proc. Automata, Languages and Programming, 26th Intn\u2019l Coll., Prague","author":"M. A. Bednarczyk","year":"1999","unstructured":"M. A. Bednarczyk and A. M. Borzyszkowski. General morphisms of Petri nets; extended abstract. In M. N. Jiri Wiedermann, Peter van Emde Boas, ed., Proc. Automata, Languages and Programming, 26th Intn\u2019l Coll., Prague, vol. 1644 of LNCS, pp. 190\u2013199. Springer, 1999."},{"issue":"1\u20134","key":"11_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3233\/FI-2000-43123402","volume":"43","author":"M. A. Bednarczyk","year":"2000","unstructured":"M. A. Bednarczyk, A. M. Borzyszkowski and R. Somla. Finite Completeness of Categories of Petri Nets. Fundamenta Informatic\u00e6, vol. 43(1\u20134): pp. 21\u201348, 2000.","journal-title":"Fundamenta Informatic\u00e6"},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-55676-1_5","volume-title":"Proc. Applications and Theory of Petri Nets","author":"C. Brown","year":"1992","unstructured":"C. Brown and D. Gurr. Refinement and simulation of nets-a categorical characterization. In K. Jensen, ed., Proc. Applications and Theory of Petri Nets, vol. 616 of LNCS, pp. 76\u201392. Springer, 1992."},{"issue":"3","key":"11_CR8","first-page":"315","volume":"E80-D","author":"J. Cortadella","year":"1997","unstructured":"J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. In IEICE Trans. on Information & Systems, vol. E80-D(3), pp. 315\u2013325, 1997.","journal-title":"IEICE Trans. on Information & Systems"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Synthesizing Petri nets from state-based models. In Proc. International Conference on Computer Aided Design, pp. 164\u2013171, 1995.","DOI":"10.1109\/ICCAD.1995.480008"},{"issue":"8","key":"11_CR10","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/12.707587","volume":"47","author":"J. Cortadella","year":"1998","unstructured":"J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Deriving Petri nets from finite transition systems. In IEEE Transactions on Computers, vol. 47(8), pp. 859\u2013882, 1998.","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR11","unstructured":"M. Droste and R. M. Shortt. Petri nets and automata with concurrency relation-an adjunction. In M. Droste and Y. Gurevich, eds., Proc. Semantics of Programming Languages and Model Theory, pp. 69\u201387, 1993."},{"key":"11_CR12","unstructured":"M. Droste and R. M. Shortt. Continuous Petri nets and transition systems. In this volume."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(86)90094-0","volume":"48","author":"C. Duboc","year":"1986","unstructured":"C. Duboc. Mixed products and asynchronous automata. Theoretical Computer Science, vol. 48: pp. 183\u2013199, 1986.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A. Ehrenfeucht","year":"1990","unstructured":"A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures, part I and II. Acta Informatica, vol. 27(4): pp. 315\u2013368, 1990.","journal-title":"Acta Informatica"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E. A. Emerson","year":"1982","unstructured":"E. A. Emerson and E. M. Clarke. Using branching time logic to synthesize synchronizations skeletons. Science of Computer Programming, vol. 2: pp. 241\u2013266, 1982.","journal-title":"Science of Computer Programming"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"S. MacLane. Categories for the Working Mathematician. Graduate Text in Mathematics. Springer, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI PB-78, \u00c5rhus University, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J. Meseguer","year":"1990","unstructured":"J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, vol. 88: pp. 105\u2013155, 1990.","journal-title":"Information and Computation"},{"key":"11_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BFb0055647","volume-title":"Proc. CONCUR\u201998","author":"R. Morin","year":"1998","unstructured":"R. Morin. Decompositions of asynchronous systems. In Proc. CONCUR\u201998, LNCS, pp. 549\u2013564. Springer, 1998."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90180-N","volume":"96","author":"M. Nielsen","year":"1992","unstructured":"M. Nielsen, G. Rozenberg, and P. S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, vol. 96: pp. 3\u201333, 1992.","journal-title":"Theoretical Computer Science"},{"key":"11_CR21","unstructured":"M. Pietkiewicz-Koutny and A. Yakovlev. Non-pure nets and their transition systems. TR. no. 528, Department of Computing Science, University of Newcastle upon Tyne, 1995."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"S. Popkorn. First Steps in Modal Logic. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511983382"},{"key":"11_CR23","unstructured":"W. Reisig. Petri Nets. EATCS Monographs in Theoretical Computer Science, vol. 4, Springer-Verlag, 1985."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/BF03180567","volume":"4","author":"M. W. Shields","year":"1992","unstructured":"M. W. Shields. Multitraces, hipertraces and partial order semantics. Formal Aspects of Computing, vol. 4: pp. 649\u2013672, 1992.","journal-title":"Formal Aspects of Computing"},{"key":"11_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0018344","volume-title":"Proc. CTCS\u201989","author":"E. W. Stark","year":"1989","unstructured":"E. W. Stark. Compositional relational semantics for indeterminate dataflow networks. In Proc. CTCS\u201989, vol. 389 of LNCS, pp. 52\u201374. Springer, 1989."},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(91)90084-F","volume":"91","author":"W. Vogler","year":"1991","unstructured":"W. Vogler. Executions: a new partial-order semantics for Petri nets. Theoretical Computer Science, vol. 91: pp. 205\u2013238, 1991.","journal-title":"Theoretical Computer Science"},{"key":"11_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-48745-X_18","volume-title":"Proc. Application and Theory of Petri Nets 1999, ICATPN\u201999","author":"W. Vogler","year":"1999","unstructured":"W. Vogler. Concurrent implementations of asynchronous transition systems. In Proc. Application and Theory of Petri Nets 1999, ICATPN\u201999, vol. 1630 of LNCS, pp. 284\u2013303. Springer, 1999."},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0890-5401(87)90032-0","volume":"72","author":"G. Winskel","year":"1987","unstructured":"G. Winskel. Petri nets, algebras, morphisms and compositionality. Information and Computation, vol. 72: pp. 197\u2013238, 1987.","journal-title":"Information and Computation"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"G. Winskel. A category of labelled Petri nets and compositional proof system (extended abstract). In Proc. Third IEEE Symposium on Logic in Computer Science, pp. 142\u2013154. IEEE, The Computer Society, Computer Society Press, 1988.","DOI":"10.1109\/LICS.1988.5113"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"G. Winskel and M. Nielsen. Models for concurrency. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, eds., Handbook of Logic in Computer Science; Semantic Modeling, vol. 4, pp. 1\u2013148. Oxford University Press, 1994.","DOI":"10.7146\/brics.v1i12.21658"}],"container-title":["Lecture Notes in Computer Science","Unifying Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45541-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:34:45Z","timestamp":1737372885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45541-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430674","9783540455417"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45541-8_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}