{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:32:46Z","timestamp":1742970766319,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030769826"},{"type":"electronic","value":"9783030769833"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-76983-3_10","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"186-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Skeleton Abstraction for Universal Temporal Properties"],"prefix":"10.1007","author":[{"given":"Sophie","family":"Wallner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-91268-4_8","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"F B\u00f8nneland","year":"2018","unstructured":"B\u00f8nneland, F., Dyhr, J., Jensen, P.G., Johannsen, M., Srba, J.: Simplification of CTL formulae for efficient model checking of Petri Nets. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 143\u2013163. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_8"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"EM Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8(2), 244\u2013263 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0019970","volume-title":"Advances in Petri Nets 1991","author":"J Desel","year":"1991","unstructured":"Desel, J.: On abstractions of nets. In: Rozenberg, G. (ed.) ICATPN 1990. LNCS, vol. 524, pp. 78\u201392. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0019970"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-55676-1_10","volume-title":"Application and Theory of Petri Nets 1992","author":"G Findlow","year":"1992","unstructured":"Findlow, G.: Obtaining deadlock-preserving skeletons for coloured nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 173\u2013192. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55676-1_10"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O Grumberg","year":"1994","unstructured":"Grumberg, O., Long, D.E.: Model checking and modular verification. ACM Trans. Program. Lang. Syst. 16(3), 843\u2013871 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b95112","volume-title":"Coloured Petri Nets. Modelling and Validation of Concurrent Systems","author":"K Jensen","year":"2009","unstructured":"Jensen, K., Kristensen, L.M.: Coloured Petri Nets. Modelling and Validation of Concurrent Systems. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/b95112"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-48153-2_21","volume-title":"Correct Hardware Design and Verification Methods","author":"S Katz","year":"1999","unstructured":"Katz, S., Grumberg, O., Geist, D.: \u201cHave i written enough properties?\u201d - a method of comparison between specification and implementation. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 280\u2013297. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48153-2_21"},{"unstructured":"Kordon, F., et al.: Complete Results for the 2019 Edition of the Model Checking Contest (2019). http:\/\/mcc.lip6.fr\/2019\/results.php","key":"10_CR8"},{"unstructured":"Lilius, J.: On the Folding of Algebraic Nets. Helsinki University of Technology (1995)","key":"10_CR9"},{"unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, New York (1989)","key":"10_CR10"},{"doi-asserted-by":"crossref","unstructured":"Padbergx, J., Gajewsky, M., Ermel, C.: Rule-based refinement of high-level nets preserving safety properties. In: Proceedings of the FASE, vol. 1382, pp. 221\u2013238 (1998)","key":"10_CR11","DOI":"10.1007\/BFb0053593"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-21834-7_7","volume-title":"Applications and Theory of Petri Nets","author":"GM Pinna","year":"2011","unstructured":"Pinna, G.M.: How much is worth to remember? A taxonomy based on Petri Nets unfoldings. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 109\u2013128. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21834-7_7"},{"issue":"14","key":"10_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3233\/FI-2000-43123413","volume":"43","author":"W Penczek","year":"2000","unstructured":"Penczek, W., Szreter, M., Gerth, R., Kuiper, R.: Improving partial order reductions for universal branching time properties. Fundamenta Informaticae 43(14), 245\u2013267 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-45740-2_20","volume-title":"Applications and Theory of Petri Nets 2001","author":"C Rust","year":"2001","unstructured":"Rust, C., Tacken, J., B\u00f6ke, C.: Pr\/T-Net based seamless design of embedded real-time systems. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 343\u2013362. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45740-2_20"},{"issue":"01","key":"10_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1142\/S0218194099000073","volume":"09","author":"VP Sliva","year":"1999","unstructured":"Sliva, V.P., Murataxx, T., Shatz, S.M.: Protocol specification design using an object-based Petri Net formalism. Int. J. Softw. Eng. Knowl. Eng. 09(01), 97\u2013125 (1999)","journal-title":"Int. J. Softw. Eng. Knowl. Eng."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-030-51831-8_16","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Schwarick","year":"2020","unstructured":"Schwarick, M., Rohr, C., Liu, F., Assaf, G., Chodak, J., Heiner, M.: Efficient unfolding of coloured Petri Nets using interval decision diagrams. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 324\u2013344. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_16"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-18086-9_31","volume-title":"Advances in Petri Nets 1987","author":"J Vautherin","year":"1987","unstructured":"Vautherin, J.: Parallel systems specifications with coloured Petri nets and algebraic specifications. In: Rozenberg, G. (ed.) APN 1986. LNCS, vol. 266, pp. 293\u2013308. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18086-9_31"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-91268-4_18","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"K Wolf","year":"2018","unstructured":"Wolf, K.: Petri Net model checking with LoLA 2. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 351\u2013362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_18"},{"unstructured":"Wolf, K.: Portfolio management in explicit model checking. In: Proceedings of the PNSE (CEUR Workshop Proceedings), vol. 2651, pp. 10\u201328 (2020)","key":"10_CR19"},{"doi-asserted-by":"publisher","unstructured":"Wimmel, H., Wolf, K.: Applying CEGAR to the Petri Net state equation. Log. Meth. Comput. Sci. 8(3) (2012). https:\/\/doi.org\/10.2168\/LMCS-8(3:27)2012","key":"10_CR20","DOI":"10.2168\/LMCS-8(3:27)2012"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76983-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:08:12Z","timestamp":1623798492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76983-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030769826","9783030769833"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76983-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lipn.univ-paris13.fr\/petrinets2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 keynote papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}