Modeling concurrency with partial orders
International Journal of Parallel Programming
On the concatenation of infinite traces (extended abstract)
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Theoretical Computer Science
Information and Computation
Partial commutation and traces
Handbook of formal languages, vol. 3
On causality semantics of nets with priorities
Fundamenta Informaticae
Model checking
The Book of Traces
Introduction to Algorithms
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Invariants and Paradigms of Concurrency Theory
PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
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
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)
Relational structures model of concurrency
Acta Informatica
Modelling Concurrency with Quotient Monoids
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Causal Message Sequence Charts
Theoretical Computer Science
Causal dataflow analysis for concurrent programs
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
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
| Hi-index | 0.00 |
This paper defines a class of labeled stratified order structures that characterizes exactly the notion of combined traces (i.e., comtraces) proposed by Janicki and Koutny in 1995. Our main technical contributions are the representation theorems showing that comtrace quotient monoid, combined dependency graph (Kleijn and Koutny 2008) and our labeled stratified order structure characterization are three different and yet equivalent ways to represent comtraces.