{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:40:50Z","timestamp":1725543650905},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346999"},{"type":"electronic","value":"9783540347002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767589_10","type":"book-chapter","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T14:38:34Z","timestamp":1150814314000},"page":"166-180","source":"Crossref","is-referenced-by-count":4,"title":["On the Construction of Pullbacks for Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Eric","family":"Fabre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1971","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-12920-0_13","volume-title":"A new Definition of Morphism on Petri Nets","author":"G. Winskel","year":"1984","unstructured":"Winskel, G.: STACS 1984. LNCS, vol.\u00a0166, pp. 140\u2013149. Springer, Heidelberg (1984)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Nielsen, M., Winskel, G.: Petri Nets and Bisimulation, BRICS report no.\u00a0RS-95-4 (January 1995)","DOI":"10.7146\/brics.v2i4.19506"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/3-540-15670-4_12","volume-title":"Seminar on Concurrency","author":"G. Winskel","year":"1985","unstructured":"Winskel, G.: Categories of models for concurrency. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol.\u00a0197, pp. 246\u2013267. Springer, Heidelberg (1985)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Event structure semantics of CCS and related languages","author":"G. Winskel","year":"1982","unstructured":"Winskel, G.: Event structure semantics of CCS and related languages. LNCS, vol.\u00a0140. Springer, Heidelberg (1982); also as report PB-159, Aarhus Univ., Denmark (April 1983)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0890-5401(87)90032-0","volume":"72","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Petri Nets, Algebras, Morphisms, and Compositionality. Information and Computation\u00a072, 197\u2013238 (1987)","journal-title":"Information and Computation"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-44919-1_12","volume-title":"Applications and Theory of Petri Nets 2003","author":"M.A. Bednarczyk","year":"2003","unstructured":"Bednarczyk, M.A., Bernardinello, L., Caillaud, B., Pawlowski, W., Pomello, L.: Modular System Development with Pullbacks. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol.\u00a02679, pp. 140\u2013160. Springer, Heidelberg (2003)"},{"issue":"1-4","key":"10_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3233\/FI-2000-43123402","volume":"43","author":"M.A. Bednarczyk","year":"2000","unstructured":"Bednarczyk, M.A., Borzyszkowski, A., Somla, R.: Finite Completeness of Categories of Petri Nets. Fundamenta Informaticae\u00a043(1-4), 21\u201348 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR9","unstructured":"Koenig, B.: Parallel Composition and Unfolding of Petri Nets (Including Some Examples), private communication (2005)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Proc. 4th Workshop of Computer Aided Verification, Montreal, pp. 164\u2013174 (1992)","DOI":"10.1007\/3-540-56496-9_14"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: Model checking using net unfoldings. Science of Computer Programming\u00a023, 151\u2013195 (1994)","journal-title":"Science of Computer Programming"},{"key":"10_CR12","series-title":"Informatik-Bericht 140","first-page":"255","volume-title":"Workshop of Concurrency, Specification and Programming","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Schr\u00f6ter, C.: Reachability Analysis Using Net Unfoldings. In: Workshop of Concurrency, Specification and Programming. Informatik-Bericht 140, vol.\u00a0II, pp. 255\u2013270. Humboldt-Universit\u00e4t zu, Berlin (2000)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-63166-6_35","volume-title":"Computer Aided Verification","author":"S. Melzer","year":"1997","unstructured":"Melzer, S., R\u00f6mer, S.: Deadlock checking using net unfoldings. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 352\u2013363. Springer, Heidelberg (1997)"},{"issue":"2","key":"10_CR14","first-page":"221","volume":"62","author":"V. Khomenko","year":"2004","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Detecting State Encoding Conflicts in STG Unfoldings Using SAT. Fundamenta Informaticae\u00a062(2), 221\u2013241 (2004) (Special Issue on Best Papers from ACSD 2003)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"10_CR15","first-page":"49","volume":"70","author":"V. Khomenko","year":"2006","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT. Fundamenta Informaticae\u00a070(1-2), 49\u201373 (2006)","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"10_CR16","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2003.811249","volume":"48","author":"A. Benveniste","year":"2003","unstructured":"Benveniste, A., Fabre, E., Haar, S., Jard, C.: Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Trans. on Automatic Control\u00a048(5), 714\u2013727 (2003)","journal-title":"IEEE Trans. on Automatic Control"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Fabre, E., Benveniste, A., Haar, S., Jard, C.: Distributed Monitoring of Concurrent and Asynchronous Systems. Journal of Discrete Event Systems, 33\u201384 (May 2005) (special issue)","DOI":"10.1007\/s10626-005-5238-5"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Fabre, E.: Distributed Diagnosis based on Trellis Processes. In: 44th Conf. on Decision and Control (CDC), Seville, Spain (December 12-15, 2005)","DOI":"10.1109\/CDC.2005.1583176"},{"key":"10_CR19","unstructured":"Fabre, E.: Trellis processes: a compact representation for runs of concurrent systems, INRIA research report, no.\u00a0RR-5554 (March 2005)"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency - ICATPN 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767589_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:33Z","timestamp":1605643593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767589_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346999","9783540347002"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11767589_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}