The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
Theoretical Computer Science
Information and Computation
Timed testing of concurrent systems
Information and Computation
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
Partial Order Semantics and Read Arcs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Invariants and Paradigms of Concurrency Theory
PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Partial Order and SOS Semantics for Linear Constraint Programs
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Process semantics of P/T-nets with inhibitor arcs
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Modelling Concurrency with Quotient Monoids
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
The mutex paradigm of concurrency
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Modelling concurrency with comtraces and generalized comtraces
Information and Computation
A generalisation of a relational structures model of concurrency
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Mutex Causality in Processes and Traces of General Elementary Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.00 |
Complexc oncurrent behaviours that cannot be handled by causal partial orders are frequently modelled by a relational structures (X,X is a set (of event occurrences),