{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T19:00:06Z","timestamp":1763665206827,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031336195"},{"type":"electronic","value":"9783031336201"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33620-1_9","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"167-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Myhill-Nerode Theorem for\u00a0Higher-Dimensional Automata"],"prefix":"10.1007","author":[{"given":"Uli","family":"Fahrenberg","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Ziemia\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-17127-8_4","volume-title":"Foundations of Software Science and Computation Structures","author":"S Barlocco","year":"2019","unstructured":"Barlocco, S., Kupke, C., Rot, J.: Coalgebra learning via duality. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 62\u201379. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_4"},{"key":"9_CR3","unstructured":"Bednarczyk, M.A.: Categories of asynchronous systems, Ph. D. thesis, University of Sussex, UK (1987)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-02930-1_12","volume-title":"Automata, Languages and Programming","author":"T Colcombet","year":"2009","unstructured":"Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 139\u2013150. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_12"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-030-17127-8_13","volume-title":"Foundations of Software Science and Computation Structures","author":"J Dubut","year":"2019","unstructured":"Dubut, J.: Trees in partial higher dimensional automata. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 224\u2013241. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_13"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemia\u0144ski, K.: Languages of higher-dimensional automata. Math. Struct. Comput. Sci. 31(5), 575\u2013613 (2021). https:\/\/arxiv.org\/abs\/2103.07557","DOI":"10.1017\/S0960129521000293"},{"key":"9_CR7","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemia\u0144ski, K.: A Kleene theorem for higher-dimensional automata. In: Klin, B., Lasota, S., Muscholl, A. (eds.) CONCUR, volume 243 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 1\u201318. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/arxiv.org\/abs\/2202.03791"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemia\u0144ski, K.: Posets with interfaces as a model for concurrency. Inf. Comput. 285(B), 104914 (2022). https:\/\/arxiv.org\/abs\/2106.10895","DOI":"10.1016\/j.ic.2022.104914"},{"key":"9_CR9","unstructured":"Fahrenberg, U., Legay, A.: Partial higher-dimensional automata. In: Moss, L.S., Sobocinski, P., (eds.) CALCO, volume 35 of Leibniz International Proceedings in Informatics, pp. 101\u2013115. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45694-5_27","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"J Fanchon","year":"2002","unstructured":"Fanchon, J., Morin, R.: Regular sets of pomsets with autoconcurrency. In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 402\u2013417. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5_27"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-02424-5_7","volume-title":"Applications and Theory of Petri Nets","author":"J Fanchon","year":"2009","unstructured":"Fanchon, J., Morin, R.: Pomset languages of finite step transition systems. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 83\u2013102. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02424-5_7"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Fishburn, P.C.: Interval orders and interval graphs: a study of partially ordered sets. Wiley (1985)","DOI":"10.1016\/0012-365X(85)90042-1"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Grabowski, J.: On partial languages. Fundamentae. Informatica 4(2), 427 (1981)","DOI":"10.3233\/FI-1981-4210"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11874683_26","volume-title":"Computer Science Logic","author":"TA Henzinger","year":"2006","unstructured":"Henzinger, T.A., Piterman, N.: Solving games without determinization. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 395\u2013410. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11874683_26"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Howar, F., Steffen, B.: Active automata learning as black-box search and lazy partition refinement. In: Jansen, N., Stoelinga, M., van den Bos, P. (eds.) A Journey from Process Algebra via Timed Automata to Model Learning. LNCS, vol. 13560, pp. 321\u2013338. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15629-8_17","DOI":"10.1007\/978-3-031-15629-8_17"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(93)90238-O","volume":"112","author":"R Janicki","year":"1993","unstructured":"Janicki, R., Koutny, M.: Structure of concurrency. Theoret. Comput. Sci. 112(1), 5\u201352 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"9_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.3233\/FI-2019-1838","volume":"169","author":"R Janicki","year":"2019","unstructured":"Janicki, R., Koutny, M.: Operational semantics, interval orders and sequences of antichains. Fundamentae Informatica 169(1\u20132), 31\u201355 (2019)","journal-title":"Fundamentae Informatica"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Johansen, C.: ST-structures. J. Logic Algeb. Methods Programm. 85(6), 1201\u20131233 (2015). https:\/\/arxiv.org\/abs\/1406.0641","DOI":"10.1016\/j.jlamp.2015.10.009"},{"issue":"1\u20133","key":"9_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.apal.2005.06.009","volume":"138","author":"O Kupferman","year":"2006","unstructured":"Kupferman, O., Safra, S., Vardi, M.Y.: Relating word and tree automata. Ann. Pure Appl. Logic 138(1\u20133), 126\u2013146 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theoret. Comput. Sci. 13, 85\u2013108 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR22","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Number 2 in Schriften des IIM. Institut f\u00fcr Instrumentelle Mathematik, Bonn (1962)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Modeling concurrency with geometry. In: POPL, pp. 311\u2013322, New York City. ACM Press (1991)","DOI":"10.1145\/99583.99625"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/BFb0015256","volume-title":"Computer Science Today","author":"V Pratt","year":"1995","unstructured":"Pratt, V.: Chu spaces and their interpretation as concurrent objects. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 392\u2013405. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015256"},{"issue":"4","key":"9_CR25","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1017\/S0960129503004031","volume":"13","author":"VR Pratt","year":"2003","unstructured":"Pratt, V.R.: Transition and cancellation in concurrency and branching time. Math. Struct. Comput. Sci. 13(4), 485\u2013529 (2003)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"9_CR26","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"W Mike","year":"1985","unstructured":"Mike, W.: Shields. Concurrent machines. Comput. J. 28(5), 449\u2013465 (1985)","journal-title":"Comput. J."},{"key":"9_CR27","unstructured":"van Glabbeek, R.J.: Bisimulations for higher dimensional automata. Email message, June (1991). http:\/\/theory.stanford.edu\/rvg\/hda"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: On the expressiveness of higher dimensional automata. Theoret. Comput. Sci. 356(3), 265\u2013290 (2006)","DOI":"10.1016\/j.tcs.2006.02.012"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: Erratum to \u201cOn the expressiveness of higher dimensional automata\u201d. Theoret. Comput. Sci. 368(1-2), 168\u2013194 (2006)","DOI":"10.1016\/j.tcs.2006.06.024"},{"issue":"4\/5","key":"9_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"RJ van Glabbeek","year":"2001","unstructured":"van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4\/5), 229\u2013327 (2001)","journal-title":"Acta Informatica"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J., Plotkin, G.D.: Configuration structures. In: LICS, pp. 199\u2013209. IEEE Computer Society (1995)","DOI":"10.1109\/LICS.1995.523257"},{"issue":"41","key":"9_CR32","doi-asserted-by":"publisher","first-page":"4111","DOI":"10.1016\/j.tcs.2009.06.014","volume":"410","author":"RJ van Glabbeek","year":"2009","unstructured":"van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and Petri nets. Theoret. Comput. Sci. 410(41), 4111\u20134159 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-71995-1_26","volume-title":"Foundations of Software Science and Computation Structures","author":"G van Heerdt","year":"2021","unstructured":"van Heerdt, G., Kapp\u00e9, T., Rot, J., Silva, A.: Learning pomset automata. In: FOSSACS 2021. LNCS, vol. 12650, pp. 510\u2013530. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71995-1_26"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55767-9","DOI":"10.1007\/3-540-55767-9"}],"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-33620-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T06:13:28Z","timestamp":1729491208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2023.deec.fct.unl.pt\/","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":"47","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":"21","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":"45% - 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":"4","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":"5","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)"}}]}}