{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:30Z","timestamp":1740099030893,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319773124"},{"type":"electronic","value":"9783319773131"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77313-1_20","type":"book-chapter","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T21:20:49Z","timestamp":1520371249000},"page":"258-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pomsets and Unfolding of Reset Petri Nets"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Chatain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Comlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Delfieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efg","family":"Jezequel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier H.","family":"Roux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(76)90067-0","volume":"3","author":"T Araki","year":"1976","unstructured":"Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theor. Comput. Sci. 3(1), 85\u2013104 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2012.04.046","volume":"449","author":"P Baldan","year":"2012","unstructured":"Baldan, P., Bruni, A., Corradini, A., K\u00f6nig, B., Rodr\u00edguez, C., Schwoon, S.: Efficient unfolding of contextual Petri nets. Theor. Comput. Sci. 449, 2\u201322 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2001.3060","volume":"171","author":"P Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Inf. Comput. 171(1), 1\u201349 (2001)","journal-title":"Inf. Comput."},{"issue":"5","key":"20_CR4","first-page":"714","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 TAC 48(5), 714\u2013727 (2003)","journal-title":"IEEE TAC"},{"issue":"3","key":"20_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01178506","volume":"28","author":"E Best","year":"1991","unstructured":"Best, E., Devillers, R.R., Kiehn, A., Pomello, L.: Concurrent bisimulations in Petri nets. Acta Inf. 28(3), 231\u2013264 (1991)","journal-title":"Acta Inf."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C Dufourd","year":"1999","unstructured":"Dufourd, C., Schnoebelen, P., Jan\u010dar, P.: Boundedness of reset P\/T nets. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 301\u2013310. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48523-6_27"},{"key":"20_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77426-6","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77426-6"},{"issue":"3","key":"20_CR8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Form. Methods Syst. Des. 20(3), 285\u2013310 (2002)","journal-title":"Form. Methods Syst. Des."},{"key":"20_CR9","unstructured":"Hickmott, S., Rintanen, J., Thi\u00e9baux, S., White, L.: Planning via Petri net unfolding. In: IJCAI, pp. 1904\u20131911 (2007)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"1993","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: von Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 164\u2013177. Springer, Heidelberg (1993). \nhttps:\/\/doi.org\/10.1007\/3-540-56496-9_14"},{"issue":"6","key":"20_CR11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U Montanari","year":"1995","unstructured":"Montanari, U., Rossi, F.: Contextual nets. Acta Inf. 32(6), 545\u2013596 (1995)","journal-title":"Acta Inf."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R Glabbeek van","year":"1989","unstructured":"van Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379, pp. 237\u2013248. Springer, Heidelberg (1989). \nhttps:\/\/doi.org\/10.1007\/3-540-51486-4_71"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-17945-3_13","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"R Glabbeek van","year":"1987","unstructured":"van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 224\u2013242. Springer, Heidelberg (1987). \nhttps:\/\/doi.org\/10.1007\/3-540-17945-3_13"},{"issue":"1","key":"20_CR14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(93)90157-O","volume":"114","author":"W Vogler","year":"1993","unstructured":"Vogler, W.: Bisimulation and action refinement. Theor. Comput. Sci. 114(1), 173\u2013200 (1993)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77313-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T21:29:53Z","timestamp":1520371793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77313-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773124","9783319773131"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77313-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}