{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:35:54Z","timestamp":1780626954999,"version":"3.54.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T00:00:00Z","timestamp":1433894400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00236-015-0244-z","type":"journal-article","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T20:36:50Z","timestamp":1433968610000},"page":"35-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Step traces"],"prefix":"10.1007","volume":"53","author":[{"given":"Ryszard","family":"Janicki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jetty","family":"Kleijn","sequence":"additional","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"}]}],"member":"297","published-online":{"date-parts":[[2015,6,10]]},"reference":[{"key":"244_CR1","first-page":"129","volume":"323","author":"P Baldan","year":"2004","unstructured":"Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. Inf. Comput. 323, 129\u2013189 (2004)","journal-title":"Inf. Comput."},{"key":"244_CR2","doi-asserted-by":"crossref","unstructured":"Biermann, I., Rozoy, B.: Reliable generalized and context dependent commutation relations. In: TAPSOFT\u201997, Lecture Notes in Computer Science, vol. 1214, pp. 165\u2013176. Springer, Berlin (1997)","DOI":"10.1007\/BFb0030594"},{"issue":"2\u20133","key":"244_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/FI-1999-402304","volume":"40","author":"N Busi","year":"1999","unstructured":"Busi, N., Pinna, G.M.: Process semantics for place\/transition nets with inhibitor and read arcs. Fundam. Inform. 40(2\u20133), 165\u2013197 (1999)","journal-title":"Fundam. Inform."},{"key":"244_CR4","unstructured":"Clerbout, M.: Commutations partielles et familles de langages. Ph.D. thesis, University of Lille (1984)"},{"key":"244_CR5","doi-asserted-by":"crossref","unstructured":"Diekert, V., Gastin, P., Petit, A.: Recognizable complex trace languages. In: MFCS 1991, Lecture Notes in Computer Science, vol. 520, pp. 131\u2013140. Springer, Berlin (1991)","DOI":"10.1007\/3-540-54345-7_56"},{"key":"244_CR6","volume-title":"The Book of Traces","year":"1995","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"244_CR7","unstructured":"Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: LICS, pp. 72\u201385. IEEE Computer Society, Silver Spring, MD (1987)"},{"key":"244_CR8","doi-asserted-by":"crossref","unstructured":"Gastin, P.: Infinite traces. In: Semantics of Systems of Concurrent Processes 1990, Lecture Notes in Computer Science, vol. 469, pp. 277\u2013308. Springer, Berlin (1990)","DOI":"10.1007\/3-540-53479-2_12"},{"key":"244_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1142\/9789814261456_0002","volume-title":"The Book of Traces","author":"HJ Hoogeboom","year":"1995","unstructured":"Hoogeboom, H.J., Rozenberg, G.: Dependence graphs. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 43\u201367. World Scientific, Singapore (1995)"},{"issue":"1","key":"244_CR10","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1006\/inco.1995.1032","volume":"117","author":"PW Hoogers","year":"1995","unstructured":"Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A trace semantics for Petri nets. Inf. Comput. 117(1), 98\u2013114 (1995)","journal-title":"Inf. Comput."},{"key":"244_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(89)90098-4","volume":"64","author":"DV Hung","year":"1989","unstructured":"Hung, D.V., Knuth, E.: Semi-commutations and Petri nets. Theor. Comput. Sci. 64, 67\u201381 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"244_CR12","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141.: Causal structures for general concurrent behaviours. In: M.S. Szczuka, L. Czaja, M. Kacprzak (eds.) CS&P, CEUR Workshop Proceedings, vol. 1032, pp. 193\u2013205. CEUR-WS.org (2013)"},{"key":"244_CR13","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141.: Generalising traces. TR-CS 1436, Newcastle University (2014)"},{"key":"244_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3233\/FI-2015-1224","volume":"139","author":"R Janicki","year":"2015","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, \u0141.: Characterising concurrent histories. Fundam. Inform. 139, 21\u201342 (2015)","journal-title":"Fundam. Inform."},{"key":"244_CR15","doi-asserted-by":"crossref","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, L.: Order structures for subclasses of generalised traces. In: LATA 2015, Lecture Notes in Computer Science, vol. 8977, pp. 689\u2013700. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-15579-1_54"},{"key":"244_CR16","doi-asserted-by":"crossref","unstructured":"Janicki, R., Koutny, M.: Invariants and paradigms of concurrency theory. In: PARLE 1991, Lecture Notes in Computer Science, vol. 506, pp. 59\u201374. Springer, Berlin (1991)","DOI":"10.1007\/978-3-662-25209-3_31"},{"issue":"1","key":"244_CR17","doi-asserted-by":"crossref","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":"244_CR18","doi-asserted-by":"crossref","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":"11","key":"244_CR19","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1016\/j.ic.2011.08.001","volume":"209","author":"R Janicki","year":"2011","unstructured":"Janicki, R., Le, D.T.M.: Modelling concurrency with comtraces and generalized comtraces. Inf. Comput. 209(11), 1355\u20131389 (2011)","journal-title":"Inf. Comput."},{"key":"244_CR20","doi-asserted-by":"crossref","unstructured":"Janicki, R., Yin, X., Zubkova, N.: Modeling interval order structures with partially commutative monoids. In: CONCUR 2012, Lecture Notes in Computer Science, vol. 7454, pp. 425\u2013439. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32940-1_30"},{"issue":"3","key":"244_CR21","first-page":"255","volume":"86","author":"G Juh\u00e1s","year":"2008","unstructured":"Juh\u00e1s, G., Lorenz, R., Mauser, S.: Causal semantics of algebraic Petri nets distinguishing concurrency and synchronicity. Fundam. Inform. 86(3), 255\u2013298 (2008)","journal-title":"Fundam. Inform."},{"issue":"3\u20134","key":"244_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.3233\/FUN-2008-873-404","volume":"87","author":"G Juh\u00e1s","year":"2008","unstructured":"Juh\u00e1s, G., Lorenz, R., Mauser, S.: Complete process semantics of Petri nets. Fundam. Inform. 87(3\u20134), 331\u2013365 (2008)","journal-title":"Fundam. Inform."},{"key":"244_CR23","doi-asserted-by":"crossref","unstructured":"Juh\u00e1s, G., Lorenz, R., Neumair, C.: Synthesis of controlled behavior with modules of signal nets. In: ICATPN 2004, Lecture Notes in Computer Science, vol. 3099, pp. 238\u2013257. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-27793-4_14"},{"key":"244_CR24","first-page":"125","volume-title":"New Developments in Formal Languages and Applications, Studies in Computational Intelligence","author":"J Kleijn","year":"2008","unstructured":"Kleijn, J., Koutny, M.: Formal languages and concurrent behaviours. In: Enguix, G.B., Jim\u00e9nez-L\u00f3pez, M.D., Mart\u00edn-Vide, C. (eds.) New Developments in Formal Languages and Applications, Studies in Computational Intelligence, vol. 113, pp. 125\u2013182. Springer, Berlin (2008)"},{"issue":"1\u20132","key":"244_CR25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.3233\/FI-2013-785","volume":"122","author":"J Kleijn","year":"2013","unstructured":"Kleijn, J., Koutny, M.: Mutex causality in processes and traces of general elementary nets. Fundam. Inform. 122(1\u20132), 119\u2013146 (2013)","journal-title":"Fundam. Inform."},{"key":"244_CR26","doi-asserted-by":"crossref","unstructured":"Kuske, D., Morin, R.: Pomsets for local trace languages\u2014recognizability, logic & Petri nets. In: CONCUR 2000, Lecture Notes in Computer Science, vol. 1877, pp. 426\u2013441. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44618-4_31"},{"issue":"2","key":"244_CR27","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: part I\u2014a theory of interprocess communication. J. ACM 33(2), 313\u2013326 (1986)","journal-title":"J. ACM"},{"issue":"3\u20134","key":"244_CR28","first-page":"265","volume":"113","author":"DTM Le","year":"2011","unstructured":"Le, D.T.M.: On three alternative characterizations of combined traces. Fundam. Inform. 113(3\u20134), 265\u2013293 (2011)","journal-title":"Fundam. Inform."},{"key":"244_CR29","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"244_CR30","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.W.: Trace theory. In: Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part II, Lecture Notes in Computer Science, vol. 255, pp. 279\u2013324. Springer, Berlin (1987)","DOI":"10.1007\/3-540-17906-2_30"},{"key":"244_CR31","unstructured":"Mazurkiewicz, A.W.: Basic notions of trace theory. In: J.W. de Bakker, W.P. de Roever, G. Rozenberg (eds.) REX Workshop, Lecture Notes in Computer Science, vol. 354, pp. 285\u2013363. Springer, Berlin (1988)"},{"issue":"4","key":"244_CR32","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.ipl.2013.11.009","volume":"114","author":"\u0141 Mikulski","year":"2014","unstructured":"Mikulski, \u0141., Koutny, M.: Folded Hasse diagrams of combined traces. Inf. Process. Lett. 114(4), 208\u2013216 (2014)","journal-title":"Inf. Process. Lett."},{"key":"244_CR33","doi-asserted-by":"crossref","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. Theor. Conput. Sci. 13, 85\u2013108 (1981)","journal-title":"Theor. Conput. Sci."},{"key":"244_CR34","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1142\/9789814261456_0010","volume-title":"The Book of Traces","author":"W Penczek","year":"1995","unstructured":"Penczek, W., Kuiper, R.: Traces and logic. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 307\u2013390. World Scientific, Singapore (1995)"},{"issue":"1","key":"244_CR35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V Pratt","year":"1986","unstructured":"Pratt, V.: Modeling concurrency with partial orders. Int. J. Parallel Program 15(1), 33\u201371 (1986)","journal-title":"Int. J. Parallel Program"},{"key":"244_CR36","doi-asserted-by":"crossref","unstructured":"Reinhardt, K.: On the synchronization of semi-traces. In: Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 965, pp. 393\u2013403. Springer, Berlin (1995)","DOI":"10.1007\/3-540-60249-6_71"},{"key":"244_CR37","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Engelfriet, J.: Elementary net systems. In: Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science, vol. 1491, pp. 12\u2013121. Springer, Berlin (1998)","DOI":"10.1007\/3-540-65306-6_14"},{"key":"244_CR38","doi-asserted-by":"crossref","unstructured":"Shields, M.: Adequate path expressions. In: G. Kahn (ed.) Semantics of Concurrent Computation, Lecture Notes in Computer Science, vol. 70, pp. 249\u2013265. Springer, Berlin (1979)","DOI":"10.1007\/BFb0022473"},{"key":"244_CR39","doi-asserted-by":"crossref","first-page":"386","DOI":"10.4064\/fm-16-1-386-389","volume":"16","author":"E Szpilrajn","year":"1930","unstructured":"Szpilrajn, E.: Sur l\u2019extension de l\u2019ordre partiel. Fundam. Math. 16, 386\u2013389 (1930)","journal-title":"Fundam. Math."},{"issue":"2","key":"244_CR40","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1006\/inco.2001.2956","volume":"179","author":"P Thiagarajan","year":"2002","unstructured":"Thiagarajan, P., Walukiewicz, I.: An expressively complete linear time temporal logic for Mazurkiewicz traces. Inf. Comput. 179(2), 230\u2013249 (2002)","journal-title":"Inf. Comput."},{"issue":"2","key":"244_CR41","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1051\/ita\/1991250201471","volume":"25","author":"W Vogler","year":"1991","unstructured":"Vogler, W.: A generalization of trace theory. RAIRO Infornatique th\u00e9orique et applications 25(2), 147\u2013156 (1991)","journal-title":"RAIRO Infornatique th\u00e9orique et applications"},{"issue":"1","key":"244_CR42","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 286(1), 33\u201363 (2002)","journal-title":"Theor. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0244-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0244-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0244-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:21:11Z","timestamp":1748438471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0244-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,10]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["244"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0244-z","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,10]]}}}