Abstract
Traces are equivalence classes of action sequences which can be represented by partial orders capturing the causality in the behaviour of a concurrent system. Generalised traces, on the other hand, are equivalence classes of step sequences. They are represented by order structures that can describe non-simultaneity and weak causality, phenomena which cannot be expressed by partial orders alone. In this paper, we provide a systematic classification of different subclasses of generalised traces in terms of the order structures representing them. We also show how the original trace model fits into the overall framework.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995)
Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: LICS, pp. 72–85. IEEE Computer Society (1987)
Hoogeboom, H.J., Rozenberg, G.: Dependence graphs. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 43–67. World Scientific (1995)
Janicki, R., Kleijn, J., Koutny, M., Mikulski, Ł.: Causal structures for general concurrent behaviours. In: Szczuka, M.S., Czaja, L., Kacprzak, M. (eds.) CS&P. CEUR Workshop Proceedings, vol. 1032, pp. 193–205. CEUR-WS.org (2013)
Janicki, R., Kleijn, J., Koutny, M., Mikulski, Ł.: Generalising traces. TR-CS 1436. Newcastle University (2014)
Janicki, R., Koutny, M.: Structure of concurrency. Theor. Comput. Sci. 112(1), 5–52 (1993)
Janicki, R., Koutny, M.: Semantics of inhibitor nets. Inf. Comput. 123(1), 1–16 (1995)
Janicki, R., Le, D.T.M.: Modelling concurrency with comtraces and generalized comtraces. Inf. Comput. 209(11), 1355–1389 (2011)
Juhás, G., Lorenz, R., Mauser, S.: Complete process semantics of Petri nets. Fundam. Inform. 87(3–4), 331–365 (2008)
Kleijn, J., Koutny, M.: Formal languages and concurrent behaviours. In: Enguix, G.B., Jiménez-López, M.D., Martín-Vide, C. (eds.) New Developments in Formal Languages and Applications. SCI, vol. 113, pp. 125–182. Springer, Heidelberg (2008)
Kleijn, J., Koutny, M.: Mutex causality in processes and traces of general elementary nets. Fundam. Inform. 122(1–2), 119–146 (2013)
Lamport, L.: The mutual exclusion problem: part I - a theory of interprocess communication. J. ACM 33(2), 313–326 (1986). http://doi.acm.org/10.1145/5383.5384
Le, D.T.M.: On three alternative characterizations of combined traces. Fundam. Inform. 113(3–4), 265–293 (2011)
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78. Aarhus University (1977)
Mazurkiewicz, A.W.: Basic notions of trace theory. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.) REX Workshop. LNCS, vol. 354, pp. 285–363. Springer, Heidelberg (1988)
Pratt, V.: Modeling concurrency with partial orders. International Journal of Parallel Programming 15(1), 33–71 (1986)
Szpilrajn, E.: Sur l’extension de l’ordre partiel. Fundam. Math. 16, 386–389 (1930)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Janicki, R., Kleijn, J., Koutny, M., Mikulski, Ł. (2015). Order Structures for Subclasses of Generalised Traces. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_54
Download citation
DOI: https://doi.org/10.1007/978-3-319-15579-1_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15578-4
Online ISBN: 978-3-319-15579-1
eBook Packages: Computer ScienceComputer Science (R0)