{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:46:18Z","timestamp":1648809978655},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T00:00:00Z","timestamp":1322092800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00236-011-0147-6","type":"journal-article","created":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T10:36:10Z","timestamp":1322130970000},"page":"15-28","source":"Crossref","is-referenced-by-count":0,"title":["Using transition set sequences to partition behaviors of petri nets"],"prefix":"10.1007","volume":"49","author":[{"given":"Yunhe","family":"Wang","sequence":"first","affiliation":[]},{"given":"Li","family":"Jiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,24]]},"reference":[{"key":"147_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, LNCS 1579, pp. 193\u2013207. Springer (1999)","DOI":"10.1007\/3-540-49059-0_14"},{"issue":"1","key":"147_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E. Best","year":"1987","unstructured":"Best E., Devillers R.: Sequential and concurrent behaviour in Petri net theory. Theor. Comput. Sci. 55(1), 87\u2013136 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"147_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00236-009-0095-6","volume":"46","author":"E. Best","year":"2009","unstructured":"Best E., Darondeau P.: A decomposition theorem for finite persistent transition systems. Acta Informatica 46, 237\u2013254 (2009)","journal-title":"Acta Informatica"},{"key":"147_CR4","unstructured":"Bonizzoni, P., Mauri, G., Pighizzini, G.: About infinite traces. In: Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I 9002, Technische Universit\u00e4t M\u00fcnchen (1989)"},{"key":"147_CR5","unstructured":"Burkhard, H.-D.: The Maximum Firing Strategy in Petri nets gives more power. ICS-PAS Report no. 411: pp. 24\u201326, Warschau (1980)"},{"key":"147_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079468","volume-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9darrangements LNCS 85","author":"P. Cartier","year":"1969","unstructured":"Cartier P., Foata D.: Probl\u00e8mes combinatoires de commutation et r\u00e9darrangements LNCS 85. Springer, Berlin, Heidelberg, New York (1969)"},{"issue":"1","key":"147_CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(94)90280-1","volume":"134","author":"V. Diekert","year":"1994","unstructured":"Diekert V.: A partial trace semantics for Petri nets. Theor. Comput. Sci. 134(1), 87\u2013105 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"147_CR8","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","volume-title":"Handbook of formal languages vol 3.","author":"V. Diekert","year":"1997","unstructured":"Diekert V., Metivier Y.: Partial commutation and traces. In: Rozenberg, G., Salomaa, A. (eds) Handbook of formal languages vol 3., pp. 457\u2013534. Springer, Berlin (1997)"},{"key":"147_CR9","doi-asserted-by":"crossref","unstructured":"Heljanko, K.: Bounded reachability checking with process semantics. In: Proceedings of 12th International Conference on Concurrency Theory, LNCS 2154, pp. 218\u2013232, Springer (2001)","DOI":"10.1007\/3-540-44685-0_15"},{"key":"147_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1153","volume":"123","author":"R. Janicki","year":"1995","unstructured":"Janicki R., Koutny M.: Semantics of inhibitor nets. Inf. Comput. 123, 1\u201316 (1995)","journal-title":"Inf. Comput."},{"key":"147_CR11","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Applications and Relationships to Other Models of Concurrency, LNCS 255, pp. 279\u2013324. Springer (1987)","DOI":"10.1007\/3-540-17906-2_30"},{"key":"147_CR12","first-page":"166","volume":"38","author":"E. Ochmanski","year":"1989","unstructured":"Ochmanski E.: Semi-commutations for place\/transition systems. Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS) 38, 166\u2013191 (1989)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS)"},{"key":"147_CR13","first-page":"12","volume-title":"Lectures on Petri Nets I Basic Models Advances in Petri Nets LNCS 1491.","author":"G. Rozenberg","year":"1998","unstructured":"Rozenberg G., Engelfriet J.: Elementary net systems. In: Reisig, W., Rozenberg, G. (eds) Lectures on Petri Nets I Basic Models Advances in Petri Nets LNCS 1491., pp. 12\u2013121. Springer, Berlin (1998)"},{"key":"147_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri nets: An introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig W.: Petri nets: An introduction. Springer, Berlin, Heidelberg, New York, Tokyo (1985)"},{"issue":"6","key":"147_CR15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.3233\/KES-2007-11604","volume":"11","author":"H.C. Thanh","year":"2007","unstructured":"Thanh H.C.: Transforming sequential processes of net systems into concurrent ones. KES J. 11(6), 391\u2013397 (2007)","journal-title":"KES J."},{"key":"147_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Jiao, L.: Canonical Transition Set Semantics for Petri Nets. In: Proceedings of 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency, LNCS 6128, pp. 84\u2013103, Springer (2010)","DOI":"10.1007\/978-3-642-13675-7_7"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0147-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-011-0147-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0147-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T01:03:26Z","timestamp":1560992606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-011-0147-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,24]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1007\/s00236-011-0147-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,24]]}}}