Modelling Concurrency with Quotient Monoids

Authors:
Ryszard Janicki;Dai Tri Lê
Affiliations:
Department of Computing and Software, McMaster University, Hamilton, Canada L8S 4K1;Department of Computing and Software, McMaster University, Hamilton, Canada L8S 4K1
Venue:
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Year:
2008

Citing 9
Cited 3

Concurrent and maximally concurrent evolution of nonsequential systems

Theoretical Computer Science
Structure of concurrency

Theoretical Computer Science
Semantics of inhibitor nets

Information and Computation
The Book of Traces

The Book of Traces
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
Adequate Path Expressions

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Process semantics of general inhibitor nets

Information and Computation
Synchronous + Concurrent + Sequential = Earlier than + Not later than

ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design

Modelling concurrency with comtraces and generalized comtraces

Information and Computation
A characterization of combined traces using labeled stratified order structures

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Mutex Causality in Processes and Traces of General Elementary Nets

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Four quotient monoids over step sequences and one with compound generators are introduced and discussed. They all can be regarded as extensions (of various degrees) of Mazurkiewicz traces [14] and comtraces of [10].