{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:29:37Z","timestamp":1743096577499,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066528"},{"type":"electronic","value":"9783031066535"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06653-5_3","type":"book-chapter","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T23:04:18Z","timestamp":1655075058000},"page":"43-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Layered Memory Automata: Recognizers for Quasi-Regular Languages with Unbounded Memory"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Bertrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanna","family":"Klaudel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Peschanski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-03459-6_4","volume-title":"Foundations and Applications of Security Analysis","author":"M Bartoletti","year":"2009","unstructured":"Bartoletti, M.: Usage automata. In: Degano, P., Vigan\u00f2, L. (eds.) ARSPA-WITS 2009. LNCS, vol. 5511, pp. 52\u201369. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03459-6_4"},{"key":"3_CR2","unstructured":"Bertrand, C.: Reconnaissance de motifs dynamiques par automates temporis\u00e9s \u00e0 m\u00e9moire. (Matching of dynamic patterns with timed memory automata). Ph.D. thesis, University of Paris-Saclay, France (2020). https:\/\/tel.archives-ouvertes.fr\/tel-03172600"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bertrand, C., Peschanski, F., Klaudel, H., Latapy, M.: Pattern matching in link streams: timed-automata with finite memory. Sci. Ann. Comput. Sci. 28(2), 161\u2013198 (2018). http:\/\/www.info.uaic.ro\/bin\/Annals\/Article?v=XXVIII2&a=1","DOI":"10.7561\/SACS.2018.2.161"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci. 411(4), 702\u2013715 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2009.10.009. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397509007518. Fundamentals of Computation Theory","DOI":"10.1016\/j.tcs.2009.10.009"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27:1\u201327:26 (2011). https:\/\/doi.org\/10.1145\/1970398.1970403","DOI":"10.1145\/1970398.1970403"},{"key":"3_CR6","unstructured":"Deharbe, A.: Analyse de ressources pour les syst\u00e8mes concurrents dynamiques. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie, France, September 2016. https:\/\/tel.archives-ouvertes.fr\/tel-01523979"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Deharbe, A., Peschanski, F.: The omniscient garbage collector: a resource analysis framework. In: 14th International Conference on Application of Concurrency to System Design, ACSD 2014, Tunis La Marsa, Tunisia, 23\u201327 June 2014, pp. 102\u2013111. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/ACSD.2014.18","DOI":"10.1109\/ACSD.2014.18"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Grigore, R., Tzevelekos, N.: History-register automata. Log. Methods Comput. Sci. 12(1) (2016). https:\/\/doi.org\/10.2168\/LMCS-12(1:7)2016","DOI":"10.2168\/LMCS-12(1:7)2016"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 561\u2013572. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13089-2_47"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Kaminski, M., Zeitlin, D.: Finite-memory automata with non-deterministic reassignment. Int. J. Found. Comput. Sci. 21(5), 741\u2013760 (2010). https:\/\/doi.org\/10.1142\/S0129054110007532","DOI":"10.1142\/S0129054110007532"},{"key":"3_CR12","unstructured":"Kara, A.: Logics on data words: expressivity, satisfiability, model checking. Ph.D. thesis, Technical University of Dortmund, Germany (2016). http:\/\/hdl.handle.net\/2003\/35216"},{"issue":"7","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1016\/j.jcss.2015.03.005","volume":"81","author":"L Libkin","year":"2015","unstructured":"Libkin, L., Tan, T., Vrgo\u010d, D.: Regular expressions for data words. J. Comput. Syst. Sci. 81(7), 1278\u20131297 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.03.005","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/3-540-44683-4_49","volume-title":"Mathematical Foundations of Computer Science 2001","author":"F Neven","year":"2001","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 560\u2013572. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_49"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Tzevelekos, N.: Fresh-register automata. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26\u201328 January 2011, pp. 295\u2013306. ACM (2011). https:\/\/doi.org\/10.1145\/1926385.1926420","DOI":"10.1145\/1926385.1926420"}],"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-031-06653-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T23:04:53Z","timestamp":1655075093000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06653-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066528","9783031066535"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06653-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 June 2022","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":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2022.github.io\/","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":"35","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":"19","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":"54% - 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)"}}]}}