{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:03:40Z","timestamp":1774915420177,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":62,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540179061","type":"print"},{"value":"9783540479260","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17906-2_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:18:00Z","timestamp":1330197480000},"page":"278-324","source":"Crossref","is-referenced-by-count":159,"title":["Trace theory"],"prefix":"10.1007","author":[{"given":"Antoni","family":"Mazurkiewicz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0166-218X(85)90080-0","volume":"11","author":"IJ. J. Aalbersberg","year":"1985","unstructured":"AALBERSBERG, IJ. J., ROZENBERG, G.: \"Traces, dependency graphs and DNLC grammars\", Discrete Applied Mathematics 11 (1985) 299\u2013306","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR2","unstructured":"AALBERSBERG, IJ. J., ROZENBERG, G.: \"Trace languages defined by context-free languages\", manuscript, (1985)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"AALBERSBERG, IJ. J., WELZL, E.: \"Trace languages defined by regular string languages\", to appear (1985)","DOI":"10.1051\/ita\/1986200201031"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-10856-4_86","volume":"118","author":"A. Bertoni","year":"1981","unstructured":"BERTONI, A., BRAMBILLA, M., MAURI, G., SABADINI, N.: \"An application of the theory of free partially commutative monoids: asymptotic densities of trace languages\", Lecture Notes in Computer Science 118 (1981) 205\u2013215","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR5","unstructured":"BERTONI, A. and GOLDWURM, M.: \"Average analysis of an algorithm for a membership problem of trace languages\", manuscript, (1986)"},{"key":"12_CR6","unstructured":"BERTONI, A., MAURI, G., SABADINI, N.: \"A hierarchy of regular trace languages and some combinatorial applications\", Proc. 2nd World Conf. on Math. at the Serv. of Men, Las Palmas (1982) 146\u2013153"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0012757","volume":"140","author":"A. Bertoni","year":"1982","unstructured":"BERTONI, A., MAURI, G., SABADINI, N.: \"Equivalence and membership problems for regular trace languages\", Lecture Notes in Computer Science 140 (1982) 61\u201371","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR8","unstructured":"BERTONI, A., MAURI, G., SABADINI, N.: \"Context \u2014 free trace languages\", Proc. 7th CAAP, Lille (1982) 32\u201342"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"BERTONI, A., MAURI, G., SABADINI, N.: \"Equivalence and membership problems for regular and context \u2014 free trace languages\", manuscript (1982)","DOI":"10.1007\/BFb0012757"},{"key":"12_CR10","unstructured":"BERTONI, A., MAURI, G., SABADINI, N.: \"Concurrency and commutativity\", manuscript (1982)"},{"key":"12_CR11","unstructured":"BERTONI, A., MAURI, G., SABADINI, N.: \"Unambiguous regular trace languages\", Proc. Colloq. on Algebra, Combinat. and Comp. Science, Gyor (1983)"},{"key":"12_CR12","unstructured":"BERTONI, A., MAURI, G., SABADINI, N.: \"Representation of prefixes of a trace and membership problem for context \u2014 free trace languages\", manuscript (1985)"},{"key":"12_CR13","unstructured":"BEST, E., FERNANDEZ, C. and PLUNNECKE, H.: \"Concurrent systems and processes\", manuscript (1985)"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(86)90056-6","volume":"22","author":"A. Carpi","year":"1986","unstructured":"CARPI, A. and LUCA, A. de: \"Square \u2014 free words on partially commutative free monoids\", Information Processing Letters 22 (1986) 125\u2013132","journal-title":"Information Processing Letters"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"CARTIER, P. and FOATA, D.: \"Problemes combinatoires de commutation et rearrangements\", Lecture Notes in Mathematics 85 (1969)","DOI":"10.1007\/BFb0079468"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(84)90053-7","volume":"34","author":"M. Clerbout","year":"1984","unstructured":"CLERBOUT, M. and LATTEUX, M.: \"Partial commutations and faithful rational transductions\", Theoretical Computer Science 34 (1984) 241\u2013254","journal-title":"Theoretical Computer Science"},{"key":"12_CR17","unstructured":"CLERBOUT, M. and LATTEUX, M.: \"Semi \u2014 commutations\", Techn. Rep. IT-63-84, Equipe Lilloise d'Inform. Theor., Univers. de Lille 1, Villeneuve d'Ascq. (1984)"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(85)90013-1","volume":"35","author":"R. Cori","year":"1984","unstructured":"CORI, R. and METIVIER, Y.: \"Recognizable subsets of some partially abelian monoids\", Theoretical Computer Science 35 (1984) 179\u2013189","journal-title":"Theoretical Computer Science"},{"key":"12_CR19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"CORI, R. and PERRIN, D.: \"Automates and commutations partielles\", RAIRO Informatique Theorique 19 (1985) 21\u201332","journal-title":"RAIRO Informatique Theorique"},{"key":"12_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(85)90121-8","volume":"20","author":"C. Duboc","year":"1985","unstructured":"DUBOC, C.: \"Some properties of commutation in free partially commutative monoids\", Information Processing Letters 20 (1985) 1\u20134","journal-title":"Information Processing Letters"},{"key":"12_CR21","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-16078-7_76","volume":"210","author":"C. Duboc","year":"1986","unstructured":"DUBOC, C.: \"Equations in free partially commutative monoids\", Lecture Notes in Computer Science 210 (1986) 192\u2013202","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"FLE, M. P. and ROUCAIROL, G.: \"On serializability of iterated transactions\", Proc. ACM SIGACT-SIGOPS Symp. on Princ. of Distrib. Comp., Ottawa (1982) 194\u2013200","DOI":"10.1145\/800220.806697"},{"key":"12_CR23","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/3-540-15204-0_10","volume":"188","author":"M. P. Fle","year":"1985","unstructured":"FLE, M. P. and ROUCAIROL, G.: \"Fair serializability of iterated transactions using FIFO \u2014 nets\", Lecture Notes in Computer Science 188 (1985) 154\u2013168","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90206-3","volume":"38","author":"M. P. Fle","year":"1985","unstructured":"FLE, M. P. and ROUCAIROL, G.: \"Maximal serializability of iterated transactions\", Theoretical Computer Science 38 (1985) 1\u201316","journal-title":"Theoretical Computer Science"},{"key":"12_CR25","volume-title":"M. Lothaire: Combinatorics on words","author":"D. Foata","year":"1983","unstructured":"FOATA, D.: \"Rearrangements of words\", in M. Lothaire: Combinatorics on words, Addison-Wesley, Reading, (1983) Chapter 10"},{"key":"12_CR26","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"4","author":"J. Grabowski","year":"1981","unstructured":"GRABOWSKI, J.: \"On partial languages\", Fundamenta Informaticae 4 (1981) 427\u2013498","journal-title":"Fundamenta Informaticae"},{"key":"12_CR27","series-title":"Working Paper","volume-title":"Grammatical projections 1. Elementary constructions","author":"G. Gyory","year":"1979","unstructured":"GYORY, G., KNUTH, E., RONYAI, L.: \"Grammatical projections 1. Elementary constructions\", Working Paper II\/3, MTA SZTAKI, Budapest (1979)"},{"key":"12_CR28","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-08921-7_77","volume":"64","author":"R. Janicki","year":"1978","unstructured":"JANICKI, R.: \"Synthesis of concurrent schemes\", Lecture Notes in Computer Science 64 (1978) 298\u2013307","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR29","unstructured":"JANICKI, R.: \"On the design of concurrent systems\", Proc. 2nd Intern. Conf. on Distrib. Comp. Systems, Paris (1981) 455\u2013466"},{"key":"12_CR30","unstructured":"JANICKI, R.: \"Mazurkiewicz traces semantics for communicating sequential processes\", Proc. 5th European Workshop on Appl. and Theory of Petri Nets, Aarhus (1984) 50\u201370"},{"key":"12_CR31","series-title":"Techn. Rep.","volume-title":"Trace semantics for communicating sequential processes","author":"R. Janicki","year":"1985","unstructured":"JANICKI, R.: \"Trace semantics for communicating sequential processes\", Techn. Rep. R-85-12, Inst. for Elektr. Syst., Aalborg Univ., Aalborg (1985)"},{"key":"12_CR32","unstructured":"KELLER, R. M.: \"A solvable program-schema equivalence problem\", Proc. 5th Ann. Princeton Conf. on Inf. Sciences and Systems, Princeton (1971) 301\u2013306"},{"key":"12_CR33","unstructured":"KNUTH, E.: \"Petri nets and regular trace languages\", manuscript (1978)"},{"key":"12_CR34","unstructured":"KNUTH, E.: \"Petri nets and trace languages\", Proc. 1st Europ. Conf. on Parallel and Distr. Processing, Toulouse (1979) 51\u201356"},{"key":"12_CR35","first-page":"31","volume":"13","author":"E. Knuth","year":"1979","unstructured":"KNUTH, E. and GYORY, G.: \"Paths and traces\", Computational Linguistics and Computer Languages 13 (1979) 31\u201342","journal-title":"Computational Linguistics and Computer Languages"},{"key":"12_CR36","first-page":"141","volume":"36","author":"F. W. Luvi","year":"1944","unstructured":"LUVI F. W.: \"On semigroups\", Bull. of the Calcutta Math. Soc. 36 (1944) 141\u2013146","journal-title":"Bull. of the Calcutta Math. Soc."},{"key":"12_CR37","series-title":"DAIMI Rep.","volume-title":"Concurrent program schemes and their interpretations","author":"Z. Mazurkiewicz","year":"1977","unstructured":"MAZURKIEWICZ, Z.: \"Concurrent program schemes and their interpretations\", DAIMI Rep. PB-78, Aarhus Univ., Aarhus (1977)"},{"key":"12_CR38","unstructured":"MAZURKIEWICZ, A.: \"Equational semantics of concurrent systems\", Proc. 8th Spring School on Comp. Sci., Colleville sur mer (1980)"},{"key":"12_CR39","unstructured":"MAZURKIEWICZ, A.: \"A calculus of execution traces for concurrent systems\", manuscript (1983)"},{"key":"12_CR40","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0030293","volume":"176","author":"A. Mazurkiewicz","year":"1984","unstructured":"MAZURKIEWICZ, A.: \"Traces, histories, graphs: instances of a process monoid\", Lecture Notes in Computer Science 176 (1984) 115\u2013133","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR41","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-15204-0_20","volume":"188","author":"A. Mazurkiewicz","year":"1985","unstructured":"MAZURKIEWICZ, A.: \"Semantics of concurrent systems: a modular fixed-point trace approach\", Lecture Notes in Computer Science 188 (1985) 353\u2013375","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR42","series-title":"Techn. Rep.","volume-title":"Une condition suffisante de reconaissabilite dans un monoide partiellement commutatif","author":"Y. Metivier","year":"1984","unstructured":"METIVIER, Y.: \"Une condition suffisante de reconaissabilite dans un monoide partiellement commutatif\", Techn. Rep. 8417, U.E.R. de Math. et d'Inform., Univ. de Bordeaux, Bordeaux (1984)"},{"key":"12_CR43","unstructured":"METIVIER, Y.: \"Sous-ensemble reconnaisable d'un monoide partiellment commutatif libre\", manuscript (1985)"},{"key":"12_CR44","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., WINSKEL, G.: \"Petri nets, event structures and domains, Part 1\", Theoretical Computer Science 13 (1981) 85\u2013108","journal-title":"Theoretical Computer Science"},{"key":"12_CR45","unstructured":"OCHMANSKI, E.: \"Regular trace languages\", Ph. D. Thesis (1985) (summary in Bull. of EATCS 27, 1985)"},{"key":"12_CR46","first-page":"329","volume":"F12","author":"D. Perrin","year":"1985","unstructured":"PERRIN, D.: \"Words over a partially commutative alphabet\", NATO ASI Series F12 (1985) 329\u2013340","journal-title":"NATO ASI Series"},{"key":"12_CR47","unstructured":"PETRI, C.A.: \"Concepts of Net Theory\", Proceedings of the Symposium and Summer School on MFCS '73, High Tatras (1973)"},{"key":"12_CR48","unstructured":"PETRI, C.A.: \"Non-Sequential Processes\", GMD-ISF Report 77.05, Gesellschaft fuer Mathematik und Datenverarbeitung mbH Bonn (1977)"},{"key":"12_CR49","unstructured":"REISIG, W.: \"Petri nets \u2014 an introduction\", EATCS Monographs on Theoretical Computer Science, Springer Verlag (1985)"},{"key":"12_CR50","unstructured":"REM, M.: \"Concurrent Computations and VLSI Circuits\", Control Flow and Data Flow: Concepts of Distributed Programming (M. Broy, editor), Springer (1985) 399\u2013437"},{"key":"12_CR51","doi-asserted-by":"crossref","unstructured":"ROZENBERG, G.: \"Behaviour of elementary net systems\", this volume (1986)","DOI":"10.1007\/978-3-540-47919-2_4"},{"key":"12_CR52","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/BFb0027048","volume":"224","author":"G. Rozenberg","year":"1986","unstructured":"ROZENBERG, G., THIAGARAJAN, P.S.: \"Petri Nets: Basic Notions, Structure and Behaviour\", Lecture Notes in Computer Science 224, (1986) 585\u2013668","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR53","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/FI-1984-7108","volume":"7","author":"W. Rytter","year":"1984","unstructured":"RYTTER, W.: \"Some properties of trace languages\", Fundamenta Informaticae 7 (1984) 117\u2013127","journal-title":"Fundamenta Informaticae"},{"key":"12_CR54","unstructured":"SAKAROVITCH, J.: \"On regular trace languages\", to appear (1986)"},{"key":"12_CR55","doi-asserted-by":"crossref","unstructured":"STARKE, P. H.: \"Processes in Petri Nets\", Elektron. Inf. und Kyb. 17 (1981)","DOI":"10.1007\/3-540-10854-8_39"},{"key":"12_CR56","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-16066-3_28","volume":"208","author":"P. H. Starke","year":"1985","unstructured":"STARKE, P. H.: \"Traces and semiwords\", Lecture Notes in Computer Science 208 (1985) 332\u2013349","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR57","doi-asserted-by":"crossref","first-page":"531","DOI":"10.3233\/FI-1981-4305","volume":"4","author":"M. Szijarto","year":"1981","unstructured":"SZIJARTO, M.: \"A classification and closure properties of languages for describing concurrent system behaviours\", Fundamenta Informaticae 4 (1981) 531\u2013549","journal-title":"Fundamenta Informaticae"},{"key":"12_CR58","series-title":"ICS PAS Report","volume-title":"Notes on the implementability of formal languages by concurrent systems","author":"A. Tarlecki","year":"1982","unstructured":"TARLECKI, A.: \"Notes on the implementability of formal languages by concurrent systems\", ICS PAS Report 481, Inst. of Comp. Science, Polish Academy of Sciences, Warszawa (1982)"},{"key":"12_CR59","doi-asserted-by":"crossref","unstructured":"THIAGARAJAN, P.S.: \"Elementary net systems\", this volume (1986)","DOI":"10.1007\/978-3-540-47919-2_3"},{"key":"12_CR60","series-title":"ICS PAS Report","volume-title":"Proving assertions about parallel programs by means of traces","author":"W. Zielonka","year":"1980","unstructured":"ZIELONKA, W.: \"Proving assertions about parallel programs by means of traces\", ICS PAS Report 424, Inst. of Comp. Science, Polish Academy of Sciences, Warszawa (1980)"},{"key":"12_CR61","unstructured":"ZIELONKA, W.: \"The notes on finite state asynchronous automata and trace languages\", manuscript (1982)"},{"key":"12_CR62","volume-title":"Trace appraoch to synchronic distances","author":"H. Zuidweg","year":"1986","unstructured":"ZUIDWEG, H.: \"Trace appraoch to synchronic distances\" (manuscript), University of Leiden, Leiden (1986)"}],"container-title":["Lecture Notes in Computer Science","Petri Nets: Applications and Relationships to Other Models of Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17906-2_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:58:33Z","timestamp":1640915913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17906-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540179061","9783540479260"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/3-540-17906-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}