{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T00:05:24Z","timestamp":1780358724870,"version":"3.54.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032278784","type":"print"},{"value":"9783032278791","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27879-1_12","type":"book-chapter","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:06:56Z","timestamp":1780355216000},"page":"245-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards General Trace Theory"],"prefix":"10.1007","author":[{"given":"Ryszard","family":"Janicki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u0141ukasz","family":"Mikulski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajiv","family":"Ranjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Best, E., Fern\u00e1ndez, C.: Nonsequential Processes: A Petri Net View. EATCS Monographs on Theoretical Computer Science. Springer, Cham (1988)","DOI":"10.1007\/978-3-642-73483-0_3"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E Best","year":"1987","unstructured":"Best, E., Devillers, R.R.: Sequential and concurrent behaviour in Petri net theory. Theoret. Comput. Sci. 55(1), 87\u2013136 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Diekert, V., M\u00e9tivier, Y.: Partial commutation and traces. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Volume 3: Beyond Words, pp. 457\u2013533. Springer, Cham (1997)","DOI":"10.1007\/978-3-642-59126-6_8"},{"key":"12_CR4","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham (2008)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144\u2013149 (1970)","journal-title":"J. Math. Psychol."},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90042-1","volume-title":"Interval Orders and Interval Graphs","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs. Wiley, Hoboken (1985)"},{"key":"12_CR7","unstructured":"Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: Proceedings of the Symposium on Logic in Computer Science (LICS 1987), Ithaca, New York, USA, 22\u201325 June 1987, pp. 72\u201385. IEEE Computer Society (1987)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Hoogeboom, H.J., Rozenberg, G.: Dependence graphs. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 43\u201367. World Scientific (1995)","DOI":"10.1142\/9789814261456_0002"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/inco.1995.1032","volume":"117","author":"P Hoogers","year":"1995","unstructured":"Hoogers, P., Kleijn, H., Thiagarajan, P.: A trace semantics for petri nets. Inf. Comput. 117(1), 98\u2013114 (1995)","journal-title":"Inf. Comput."},{"issue":"1","key":"12_CR10","first-page":"21","volume":"139","author":"R Janicki","year":"2015","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141: Characterising concurrent histories. Fund. Inform. 139(1), 21\u201342 (2015)","journal-title":"Fund. Inform."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00236-015-0244-z","volume":"53","author":"R Janicki","year":"2016","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141: Step traces. Acta Informatica 53(1), 35\u201365 (2016)","journal-title":"Acta Informatica"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.tcs.2020.10.019","volume":"862","author":"R Janicki","year":"2021","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141: Relational structures for concurrent behaviours. Theor. Comput. Sci. 862, 174\u2013192 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141.: Paradigms of Concurrency - Observations, Behaviours, and Systems - a Petri Net View. Studies in Computational Intelligence, vol.\u00a01020. Springer, Cham (2022)","DOI":"10.1007\/978-3-662-64821-6"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141.: Relational structures for interval order semantics of concurrent systems. In: Kristensen, L.M., van\u00a0der Werf, J.M.E.M. (eds.) Application and Theory of Petri Nets and Concurrency - 45th International Conference, PETRI NETS 2024, Geneva, Switzerland, 26\u201328 June 2024. LNCS, vol. 14628, pp. 153\u2013174. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-61433-0_8"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-54152-7_58","volume-title":"PARLE \u201991 Parallel Architectures and Languages Europe","author":"R Janicki","year":"1991","unstructured":"Janicki, R., Koutny, M.: Invariants and paradigms of concurrency theory. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol. 506, pp. 59\u201374. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54152-7_58"},{"issue":"1","key":"12_CR16","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. Theor. Comput. Sci. 112(1), 5\u201352 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","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), 1\u201316 (1995)","journal-title":"Inf. Comput."},{"issue":"5","key":"12_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s002360050090","volume":"34","author":"R Janicki","year":"1997","unstructured":"Janicki, R., Koutny, M.: Fundamentals of modelling concurrency using discrete relational structures. Acta Informatica 34(5), 367\u2013388 (1997)","journal-title":"Acta Informatica"},{"issue":"1\u20132","key":"12_CR19","first-page":"31","volume":"169","author":"R Janicki","year":"2019","unstructured":"Janicki, R., Koutny, M.: Operational semantics, interval orders and sequences of antichains. Fund. Inform. 169(1\u20132), 31\u201355 (2019)","journal-title":"Fund. Inform."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ic.2016.12.009","volume":"253","author":"R Janicki","year":"2017","unstructured":"Janicki, R., Yin, X.: Modeling concurrency with interval traces. Inf. Comput. 253, 78\u2013108 (2017)","journal-title":"Inf. Comput."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Khemani, D.: Search Methods in Artificial Intelligence. Cambridge University Press (2024)","DOI":"10.1017\/9781009284349"},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00236-003-0122-y","volume":"40","author":"V Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Infortmatica 40(2), 95\u2013118 (2003)","journal-title":"Acta Infortmatica"},{"issue":"7","key":"12_CR23","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: part I - a theory of interprocess communication. J. ACM 33(2), 313\u2013326 (1986)","journal-title":"J. ACM"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10703-018-0316-0","volume":"53","author":"H Ponce\u00a0de\u00a0Le\u00f3n","year":"2018","unstructured":"Ponce\u00a0de\u00a0Le\u00f3n, H., Mokhov, A.: Compact and efficiently verifiable models for concurrent systems. Formal Methods Syst. Des. 53(3), 407\u2013431 (2018). https:\/\/doi.org\/10.1007\/s10703-018-0316-0","journal-title":"Formal Methods Syst. Des."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI report. PB\u00a078, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"12_CR27","unstructured":"Mazurkiewicz, A.W.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, Germany, 8\u201319 September 1986. LNCS, vol.\u00a0255, pp. 279\u2013324. Springer, Cham (1986)"},{"key":"12_CR28","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.) Computer Aided Verification, Fourth International Workshop, CAV 1992, Montreal, Canada, 29 June\u20131 July 1992. LNCS, vol.\u00a0663, pp. 164\u2013177. Springer, Cham (1992)"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-15201-1_25","volume-title":"Software Engineering and Formal Methods","author":"\u0141 Mikulski","year":"2015","unstructured":"Mikulski, \u0141, Niewiadomski, A., Pi\u0105tkowski, M., Smyczy\u0144ski, S.: On generation of context-abstract plans. In: Canal, C., Idani, A. (eds.) SEFM 2014. LNCS, vol. 8938, pp. 376\u2013388. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15201-1_25"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Mikulski, \u0141., Pi\u0105tkowski, M., Smyczy\u0144ski, S.: Lexicographical generations of combined traces. In: Proceedings of ACSD 2013, pp. 196\u2013205. IEEE Computer Society (2013)","DOI":"10.1109\/ACSD.2013.24"},{"key":"12_CR31","unstructured":"Petri, C.A.: Fundamentals of a theory of asynchronous information flow. In: Information Processing, Proceedings of the 2nd IFIP Congress 1962, Munich, Germany, 27 August\u20131 September 1962, pp. 386\u2013390. North-Holland (1962)"},{"key":"12_CR32","unstructured":"Petri, C.A.: Concepts of net theory. In: Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, Strbsk\u00e9 Pleso, High Tatras, Czechoslovakia, 3\u20138 September 1973, pp. 137\u2013146. Mathematical Institute of the Slovak Academy of Sciences (1973)"},{"issue":"1","key":"12_CR33","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"VR Pratt","year":"1986","unstructured":"Pratt, V.R.: Modeling concurrency with partial orders. Int. J. Parallel Prog. 15(1), 33\u201371 (1986)","journal-title":"Int. J. Parallel Prog."},{"issue":"1","key":"12_CR34","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(01)00234-1","volume":"286","author":"W Vogler","year":"2002","unstructured":"Vogler, W.: Partial order semantics and read arcs. Theoret. Comput. Sci. 286(1), 33\u201363 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"12_CR35","first-page":"313","volume":"33","author":"N Wiener","year":"1914","unstructured":"Wiener, N.: A contribution to the theory of relative position. Proc. Cambridge Philos. Soc. 33(2), 313\u2013326 (1914)","journal-title":"Proc. Cambridge Philos. Soc."}],"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-032-27879-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:06:58Z","timestamp":1780355218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27879-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032278784","9783032278791"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27879-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2026.informatik.uni-hamburg.de\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}