Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Connections between a concrete and an abstract model of concurrent systems
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
A trace semantics for Petri nets
Information and Computation
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science
Stable trace automata vs. full trace automata
Theoretical Computer Science
The Book of Traces
Concurrency, Automata and Domains
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
On the Semantics of Place/Transition Nets
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Nondeterministic Automata with Concurrency Relations and Domains
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Categories of asynchronous systems
Categories of asynchronous systems
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
MSO Logic for Unambiguous Shared-Memory Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Canonizable partial order generators
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold's CCI sets of P-traces, studied in the framework of local trace languages. Also, a connection between these models and classical traces is presented in details through a natural notion of projection. These relationships enable us to use efficiently Arnold's result in two other frameworks. First, we give a finite distributed implementation for regular CCI sets of P-traces (or, equivalently, finite stably concurrent automata) by means of bounded labelled Petri nets. Second, we present a new, simple and constructive method to relate Stark's trace automata with Bednarczyk's asynchronous transition systems. This improves a recent result in Scott domain theory.