Abstract
Interval order structures are useful tools to model abstract concurrent histories, i.e. sets of equivalent system runs, when system runs are modeled with interval orders. The paper shows how interval order structures can be modeled by partially commutative monoids, called interval traces.
Partially supported by NSERC Grant of Canada, ORF Grant of Ontario, and McMaster Centre for Safety-Critical Software Certification.
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
Abraham, U., Ben-David, S., Magidor, M.: On global-time and inter-process communication. In: Semantics for Concurrency, Workshops in Computing, pp. 311–323. Springer, Heiderberg (1990)
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)
Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. Journal of Mathematical Psychology 7, 144–149 (1970)
Janicki, R.: Relational Structures Model of Concurrency. Acta Inform. 45, 279–320 (2008)
Janicki, R., Kleijn, J., Koutny, M.: Quotient Monoids and Concurrent Behaviours. In: Martin-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 311–385. Imperial College Press, London (2010)
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–74. Springer, Heidelberg (1991)
Janicki, R., Koutny, M.: Structure of Concurrency. Theor. Comput. Sci. 112, 5–52 (1993)
Janicki, R., Koutny, M.: Semantics of Inhibitor Nets. Inf. Comput. 123(1), 1–16 (1995)
Janicki, R., Koutny, M.: Fundamentals of Modelling Concurrency Using Discrete Relational Structures. Acta Inform. 34, 367–388 (1997)
Janicki, R., Lê, D.T.M.: Modelling Concurrency with Comtraces and Generalized Comtraces. Inf. Comput. 209, 1355–1389 (2011)
Kleijn, H.C.M., Koutny, M.: Process Semantics of General Inhibitor Nets. Inf. Comput. 190, 18–69 (2004)
Kleijn, J., Koutny, M.: Formal Languages and Concurrent Behaviour. Studies in Computational Intelligence 113, 125–182 (2008)
Lamport, L.: The mutual exclusion problem: Part I - a theory of interprocess communication; Part II - statements and solutions. Journal of ACM 33(2), 313–326 (1986)
Lê, D.T.M.: On Three Alternative Characterizations of Combined Traces. Fundam. Informaticae 113, 265–293 (2011)
Mazurkiewicz, A.: Concurrent Program Schemes and Their Interpretation. TR DAIMI PB-78, Comp. Science Depart. Aarhus University (1977)
Mazurkiewicz, A.: Introduction to Trace Theory. In: [2], pp. 3–42
Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Behavioural Notions for Elementary Net Systems. Distributed Computing 4, 45–57 (1990)
Szpilrajn, E.: Sur l’extension de l’ordre partiel. Fundam. Mathematicae 16, 386–389 (1930)
Wiener, N.: A contribution to the theory of relative position. Proc. of the Cambridge Philosophical Society 17, 441–449 (1914)
Zuberek, W.M.: Timed Petri nets and preliminary performance evaluation. In: Proc. of the 7th Annual Symp. on Computer Architecture, La Baule, France, pp. 89–96 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janicki, R., Yin, X., Zubkova, N. (2012). Modeling Interval Order Structures with Partially Commutative Monoids. In: Koutny, M., Ulidowski, I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32940-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-32940-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32939-5
Online ISBN: 978-3-642-32940-1
eBook Packages: Computer ScienceComputer Science (R0)