A generalisation of a relational structures model of concurrency

Authors:
Ryszard Janicki
Affiliations:
Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada
Venue:
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Year:
2004

Citing 17
Cited 0

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

Journal of the ACM (JACM)
Concurrent histories: a basis for observing distributed systems

Journal of Computer and System Sciences
Operational and algebraic semantics of concurrent processes

Handbook of theoretical computer science (vol. B)
Structure of concurrency

Theoretical Computer Science
Semantics of inhibitor nets

Information and Computation
Timed testing of concurrent systems

Information and Computation
Operational and denotational semantics for the box algebra

Theoretical Computer Science
On causality semantics of nets with priorities

Fundamenta Informaticae
What it means for a concurrent program to satisfy a specification: why no one has specified priority

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The synthesis problem for elementary net systems with inhibitor arcs

Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems

Fundamenta Informaticae
Partial Order Semantics and Read Arcs

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Invariants and Paradigms of Concurrency Theory

PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
Partial Order and SOS Semantics for Linear Constraint Programs

COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Domain and event structure semantics for Petri nets with read and inhibitor arcs

Theoretical Computer Science
Process semantics of P/T-nets with inhibitor arcs

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how complex concurrent behaviours can be modelled by relational structures ($X, \diamondsuit, \sqsubset$), where X is a set (of event occurrences), $\diamondsuit$ (interpreted as commutativity), $\sqsubset$ (interpreted as weak causality) are binary relations on X. The paper is a continuation of the approach initiated in [6,18,1,9] substantially developed in [10,12], and recently partially generalized in [7]. For the first time an axiomatic model for the most general case is given. The results can be interpreted as a generalisation of Szpilrajn Theorem [25].