{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:44:49Z","timestamp":1772786689772,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540539827","type":"print"},{"value":"9783540465638","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53982-4_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:20:54Z","timestamp":1330208454000},"page":"42-56","source":"Crossref","is-referenced-by-count":7,"title":["On the domain of traces and sequential composition"],"prefix":"10.1007","author":[{"given":"Martz Z.","family":"Kwiatkowska","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I.J. Aalbersberg","year":"1988","unstructured":"Aalbersberg I.J., Rozenberg G., Theory of Traces, Theoretical Computer Science 60 (1988) 1\u201382.","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","volume":"20","author":"L. Boasson","year":"1980","unstructured":"Boasson L., Nivat M., Adherences of Languages, Journal of Computer and System Sciences 20 (1980) 285\u2013309.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR3","first-page":"21","volume":"19","author":"R Cori","year":"1985","unstructured":"Cori R, Perrin D., Automates et commutations partielles, RAIRO Theoretical Informatics and Applications 19 (1985) 21\u201332.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"3_CR4","unstructured":"Diekert V., On the Concatenation of Infinite Traces, to appear in Proceedings, Symposium on Theoretical Aspects of Computer Science (STACS 91), Lecture Notes in Computer Science (Springer, 1991)."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Gastin P., Infinite Traces, in I. Guessarian, ed., Semantics of Systems of Concurrent Processes, Lecture Notes in Computer Science 469 (Springer, 1990)","DOI":"10.1007\/3-540-53479-2_12"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Gierz G., Hofmann K.H., Keimel K., Lawson J.D., Mislove M., Scott D., A Compendium of Continuous Lattices (Springer, 1980).","DOI":"10.1007\/978-3-642-67678-9"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0020-0190(90)90061-2","volume":"35","author":"M.Z. Kwiatkowska","year":"1990","unstructured":"Kwiatkowska M.Z., A Metric for Traces, Information Processing Letters 35, 3 (1990).","journal-title":"Information Processing Letters"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01887206","volume":"1","author":"M.Z. Kwiatkowska","year":"1989","unstructured":"Kwiatkowska M.Z., Event Fairness and Non-Interleaving Concurrency, Formal Aspects of Computing 1 3 (1989).","journal-title":"Formal Aspects of Computing"},{"key":"3_CR9","unstructured":"Kwiatkowska M.Z., Fairness for Non-Interleaving Concurrency, PhD Thesis, University of Leicester (1989). Also available as Technical Report No. 22, University of Leicester, Department of Computing Studies (1989)."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kwiatkowska M.Z., On Topological Characterization of Behavioural Properties, to appear in: G.M. Reed & A.W. Roscoe, eds., Topology in Computer Science (Oxford University Press, 1990).","DOI":"10.1093\/oso\/9780198537601.003.0006"},{"key":"3_CR11","unstructured":"Kwiatkowska M.Z., Causality and Fairness Properties, submitted."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kwiatkowska M.Z., Defining Process Fairness for Non-Interleaving Concurrency, in K.V.Nori and C.E. Madhavan, eds., Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 472 (Springer, 1990).","DOI":"10.1007\/3-540-53487-3_52"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-19020-1_7","volume":"298","author":"J. Lawson","year":"1988","unstructured":"Lawson J., The Versatile Continuous Order, in: M. Main et al, eds., Mathematical Foundations of Programming Language Semantics 1987, Lecture Notes in Computer Science 298 (Springer, 1988) 134\u2013160.","journal-title":"Lecture Notes in Computer Science"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, DAIMI Report PB-78, Aarhus University (1977).","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz A., Traces, Histories, Graphs: Instances of a Process Monoid, in: Chytil M.P., Koubek V., eds., Mathematical Foundations of Computer Science 1984, Lecture Notes in Computer Science 176 (Springer, 1984).","DOI":"10.1007\/BFb0030293"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BFb0013025","volume":"354","author":"A. Mazurkiewicz","year":"1989","unstructured":"Mazurkiewicz A., Basic Notions of Trace Theory, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg, eds., Linear Time, Branching time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354 (Springer, 1989) 285\u2013263.","journal-title":"Lecture Notes in Computer Science"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Pnueli A., Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends, in: de Bakker, de Roever, Rozenberg, eds., Current Trends in Concurrency, Lecture Notes in Computer Science 224 (Springer, 1986).","DOI":"10.1007\/BFb0027047"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Shields M.W., Deterministic Asynchronous Automata, in: Formal Methods in Programming (North-Holland, 1985).","DOI":"10.1007\/3-540-15641-0_26"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53982-4_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T13:52:43Z","timestamp":1713621163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}