Pomset Languages of Finite Step Transition Systems

Authors:
Jean Fanchon;Rémi Morin
Affiliations:
CNRS, LAAS, Toulouse, France F-31077 and Université de Toulouse, UPS, INSA, INP, ISAE, LAAS, Toulouse, France F-31077;Laboratoire d'Informatique Fondamentale de Marseille, LIF, CNRS, UMR 6166, and Aix-Marseille Université, Marseille, France F-13288
Venue:
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Year:
2009

Citing 19
Cited 0

Modeling concurrency with partial orders

International Journal of Parallel Programming
On the interrelation between synchronized and non-synchronized behaviour of Petri Nets

Journal of Information Processing and Cybernetics
The equational theory of pomsets

Theoretical Computer Science
Partial (set) 2-structures. Part II: state spaces of concurrent systems

Acta Informatica
A trace semantics for Petri nets

Information and Computation
The monadic second-order logic of graphs X: linear orderings

Theoretical Computer Science
Languages, automata, and logic

Handbook of formal languages, vol. 3
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
Modular Construction and Partial Order Semantics of Petri Nets

Modular Construction and Partial Order Semantics of Petri Nets
Recognizable Sets of Message Sequence Charts

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Regular Sets of Pomsets with Autoconcurrency

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Pomsets for local trace languages

Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Towards a language theory for infinite N-free pomsets

Theoretical Computer Science
A theory of regular MSC languages

Information and Computation
Message-passing automata are expressively equivalent to EMSO logic

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Tree acceptors and some of their applications

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Step transition systems form a powerful model to describe the concurrent behaviors of distributed or parallel systems. They offer also a general framework for the study of marking graphs of Petri nets [22]. In this paper we investigate a natural labeled partial order semantics for step transition systems. As opposed to [19] we allow for autoconcurrency by considering steps that are multisets of actions. First we prove that the languages of step transition systems are precisely the width-bounded languages that are step-closed and quasi-consistent . Extending results from [19] we focus next on finite step transition systems and characterize their languages in the line of Buchi's theorem. Our main result present six equivalent conditions in terms of regularity and MSO-definability for a set of labeled partial orders to be recognized by some finite step transition system.