{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:25Z","timestamp":1725664045581},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:30Z","timestamp":1330263630000},"page":"264-275","source":"Crossref","is-referenced-by-count":7,"title":["Regular marked Petri nets"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Desel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"23_CR1","first-page":"293","volume":"657","author":"P. Alimonti","year":"1992","unstructured":"Alimonti,P.; Feuerstein,E.: Petri Nets, Hypergraphs and Conflicts. Proc. Graph-Theoretical Concepts in Computer Science WG'92, LNCS 657 (1992) 293\u2013309","journal-title":"LNCS"},{"issue":"2","key":"23_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01888220","volume":"2","author":"E. Best","year":"1990","unstructured":"Best,E.; Desel,J.: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing 2 (2) (1990) 123\u2013138","journal-title":"Formal Aspects of Computing"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(92)90048-K","volume":"101","author":"E. Best","year":"1992","unstructured":"Best,E.; Desel,J.; Esparza,J.: Traps Characterise Home States in Free Choice Systems. Theoretical Computer Science 101 (1992) 161\u2013176","journal-title":"Theoretical Computer Science"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00289141","volume":"21","author":"E. Best","year":"1984","unstructured":"Best,E.; Voss,K.: Free Choice Systems have Home States. Acta Informatica 21 (1984) 89\u2013100","journal-title":"Acta Informatica"},{"issue":"12","key":"23_CR5","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1109\/9.106153","volume":"AC-36","author":"J. Campos","year":"1991","unstructured":"Campos,J.; Chiola,G.; Silva,M.: Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control AC-36 (12) (1991) 1368\u20131382","journal-title":"IEEE Transactions on Automatic Control"},{"key":"23_CR6","unstructured":"Colom,J.M.; Campos,J.; Silva,M.: On Liveness Analysis Through Linear Algebraic Techniques. Departamento de Ingenieria Electrica e Informatica, Universidad de Zaragoza, Research Report GISI-RR-90-11 (1990)"},{"key":"23_CR7","first-page":"134","volume":"616","author":"J. Desel","year":"1992","unstructured":"Desel,J.: A Proof of the Rank Theorem for Extended Free Choice Nets. Proc. Application and Theory of Petri Nets 1992, LNCS 616 (1992) 134\u2013153","journal-title":"LNCS"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(93)90154-L","volume":"114","author":"J. Desel","year":"1993","unstructured":"Desel,J.; Esparza,J.: Reachability in Cyclic Extended Free-Choice Systems. Theoretical Computer Science 114 (1993) 93\u2013118","journal-title":"Theoretical Computer Science"},{"key":"23_CR9","first-page":"224","volume":"619","author":"J. Desel","year":"1993","unstructured":"Desel,J.; Esparza,J.: Shortest Paths in Reachability Graphs. Proc. Application and Theory of Petri Nets 1993, LNCS 619 (1993) 224\u2013241","journal-title":"LNCS"},{"key":"23_CR10","first-page":"182","volume":"458","author":"J. Esparza","year":"1990","unstructured":"Esparza,J.: Synthesis Rules for Petri Nets, and How they Lead to New Results. Proc. CONCUR'90, LNCS 458 (1990) 182\u2013198","journal-title":"LNCS"},{"key":"23_CR11","first-page":"243","volume":"483","author":"J. Esparza","year":"1991","unstructured":"Esparza,J.; Silva,M.: On the Analysis and Synthesis of Free Choice Systems. Advances in Petri Nets 1990, LNCS 483 (1991) 243\u2013286","journal-title":"LNCS"},{"key":"23_CR12","unstructured":"Hack, M.: Petri Net Languages. MIT Laboratory Computer Science TR-159 (1976)"},{"key":"23_CR13","first-page":"413","volume":"254","author":"M. Jantzen","year":"1987","unstructured":"Jantzen,M.: Complexity of Place\/Transition Nets. Petri Nets: Central Models and their Properties, LNCS 254 (1987) 413\u2013434","journal-title":"LNCS"},{"key":"23_CR14","unstructured":"Reisig,W.: Petri Nets. EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag (1985)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:38Z","timestamp":1619572178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}