{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:54:26Z","timestamp":1725533666492},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024238"},{"type":"electronic","value":"9783642024245"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02424-5_12","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T10:40:41Z","timestamp":1245235241000},"page":"183-203","source":"Crossref","is-referenced-by-count":0,"title":["Hasse Diagram Generators and Petri Nets"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-65306-6_22","volume-title":"Lectures on Petri Nets I: Basic Models","author":"E. Badouel","year":"1998","unstructured":"Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 529\u2013586. Springer, Heidelberg (1998)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/11767589_21","volume-title":"Petri Nets and Other Models of Concurrency - ICATPN 2006","author":"R. Bergenthum","year":"2006","unstructured":"Bergenthum, R., Desel, J., Juh\u00e1s, G., Lorenz, R.: Can I execute my scenario in your net? viptool tells you! In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol.\u00a04024, pp. 381\u2013390. Springer, Heidelberg (2006)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-68746-7_25","volume-title":"Applications and Theory of Petri Nets","author":"R. Bergenthum","year":"2008","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of petri nets from scenarios with viptool. In: van Hee, K.M., Valk, R. (eds.) ICATPN 2008. LNCS, vol.\u00a05062, pp. 388\u2013398. Springer, Heidelberg (2008)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-44988-4_6","volume-title":"Application and Theory of Petri Nets 2000","author":"E. Best","year":"2000","unstructured":"Best, E., Wimmel, H.: Reducing k-safe petri nets to pomset-equivalent 1-safe petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 63\u201382. Springer, Heidelberg (2000)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BFb0055646","volume-title":"CONCUR \u201998 Concurrency Theory","author":"P. Darondeau","year":"1998","unstructured":"Darondeau, P.: Deriving Unbounded Petri Nets from Formal Languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 533\u2013548. Springer, Heidelberg (1998)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44988-4_2","volume-title":"Application and Theory of Petri Nets 2000","author":"P. Darondeau","year":"2000","unstructured":"Darondeau, P.: Region based synthesis of P\/T-nets and its potential applications. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 16\u201323. Springer, Heidelberg (2000)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"12_CR8","unstructured":"Badouel, E., Darondeau, P.: On the synthesis of general petri nets. Technical Report PI-1061, IRISA (November 1996)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/BFb0036914","volume-title":"Automata, Languages and Programming","author":"U. Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: Processes of place\/transition nets. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 264\u2013277. Springer, Heidelberg (1983)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/11494744_17","volume-title":"Applications and Theory of Petri Nets 2005","author":"G. Juh\u00e1s","year":"2005","unstructured":"Juh\u00e1s, G., Lorenz, R., Desel, J.: Can I execute my scenario in your net? In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 289\u2013308. Springer, Heidelberg (2005)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Lorenz, R., Bergenthum, R., Desel, J.: Synthesis of petri nets from infinite partial languages. In: ACSD, pp. 170\u2013179 (2008)","DOI":"10.1109\/ACSD.2008.4574609"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Lorenz, R., Bergenthum, R., Desel, J., Mauser, S.: Synthesis of petri nets from finite partial languages. In: Proceedings of ACSD, pp. 157\u2013166 (2007)","DOI":"10.1109\/ACSD.2007.34"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/11767589_17","volume-title":"Petri Nets and Other Models of Concurrency - ICATPN 2006","author":"R. Lorenz","year":"2006","unstructured":"Lorenz, R., Juh\u00e1s, G.: Towards synthesis of petri nets from scenarios. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol.\u00a04024, pp. 302\u2013321. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02424-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:34Z","timestamp":1558381054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02424-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024238","9783642024245"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02424-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}