Modelling concurrency with comtraces and generalized comtraces
DOI10.1016/j.ic.2011.08.001zbMath1244.68057OpenAlexW2140884424MaRDI QIDQ651308
Ryszard Janicki, Dai Tri Man Lê
Publication date: 12 December 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.08.001
causalitycanonical representationsimultaneitytrace monoidgeneralized trace theorystep sequencestratified order structurestratified partial orderweak causality
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Process semantics of general inhibitor nets
- Structure of concurrency
- Relational structures model of concurrency
- Concurrent and maximally concurrent evolution of nonsequential systems
- Fundamentals of modelling concurrency using discrete relational structures
- Semantics of inhibitor nets
- Combinatorial problems of commutation and rearrangements
- Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations*
- A generalization of traces
- Modelling Concurrency with Quotient Monoids
- A Characterization of Combined Traces Using Labeled Stratified Order Structures
- Notes on finite asynchronous automata
- Applications and Theory of Petri Nets 2004
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
This page was built for publication: Modelling concurrency with comtraces and generalized comtraces