Modeling concurrency with partial orders
International Journal of Parallel Programming
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
The equational theory of pomsets
Theoretical Computer Science
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
A partial trace semantics for Petri nets
Selected papers of the second international colloquium on Words, languages and combinatorics
A trace semantics for Petri nets
Information and Computation
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science
Partial commutation and traces
Handbook of formal languages, vol. 3
Asynchronous cellular automata for promsets
Theoretical Computer Science
Series-parallel languages and the bounded-width property
Theoretical Computer Science
The Book of Traces
Infinite Series-Parallel Posets: Logic and Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On the Semantics of Place/Transition Nets
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency
CONCUR '96 Proceedings of the 7th 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
A Further Step towards a Theory of Regular MSC Languages
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
Semi-traces and Their Application in Concurrency Control Problem
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design
| Hi-index | 0.00 |
Mazurkiewicz traces can be seen as equivalence classes of words or as pomsets. Their generalisation by local traces was formalized by Hoogers, Kleijn and Thiagarajan as equivalence classes of step firing sequences. First we introduce a pomset representation for local traces. Extending Büchi's Theorem and a previous generalisation to Mazurkiewicz traces, we show then that a local trace language is recognized by a finite step transition system if and only if its class of pomsets is bounded and definable in the Monadic Second Order logic. Finally, using Zielonka's Theorem, we show that each recognizable local trace language is described by a finite safe labelled Petri net. The complete version [22] of this paper is accessible on the web.