Modeling interval order structures with partially commutative monoids

Authors:
Ryszard Janicki;Xiang Yin;Nadezhda Zubkova
Affiliations:
Department of Computing and Software, McMaster University, Hamilton, Canada;Department of Computing and Software, McMaster University, Hamilton, Canada;Department of Computing and Software, McMaster University, Hamilton, Canada
Venue:
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Year:
2012

Citing 10
Cited 0

The mutual exclusion problem: part I—a theory of interprocess communication

Journal of the ACM (JACM)
Invariants and paradigms of concurrency theory

PARLE '91 Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages
Structure of concurrency

Theoretical Computer Science
Semantics of inhibitor nets

Information and Computation
The Book of Traces

The Book of Traces
Timed Petri nets and preliminary performance evaluation

ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Process semantics of general inhibitor nets

Information and Computation
Relational structures model of concurrency

Acta Informatica
Modelling concurrency with comtraces and generalized comtraces

Information and Computation
On Three Alternative Characterizations of Combined Traces

Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010

Quantified Score

Hi-index	0.00

Visualization

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.