The synthesis of petri nets from path-automatic specifications

Authors:
E. Badouel;Ph. Darondeau
Affiliations:
IRISA, Campus de Beaulieu, F35042 Rennes Cedex, France;IRISA, Campus de Beaulieu, F35042 Rennes Cedex, France
Venue:
Information and Computation
Year:
2004

Citing 14
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Rational equivalence relations

Theoretical Computer Science
Partial (set) 2-structures. Part I: basic notions and the representation problem

Acta Informatica
Partial (set) 2-structures. Part II: state spaces of concurrent systems

Acta Informatica
Modal specifications

Proceedings of the international workshop on Automatic verification methods for finite state systems
Petri nets and automata with concurrency relations—an adjunction

Semantics of programming languages and model theory
On the Petri net realization of context-free graphs

Theoretical Computer Science
Word Processing in Groups

Word Processing in Groups
Polynomial Algorithms for the Synthesis of Bounded Nets

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Deriving Unbounded Petri Nets from Formal Languages

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Theory of Regions

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A Short Introduction to Infinite Automata

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automatic Presentations of Structures

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Automatic Structures

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Analysis of properties of petri synthesis net

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Path-automatic specifications are rational presentations of sets of finite or infinite graphs. A specification is made of a regular set of paths and rational relations on this set. Each action is specified by two relations that define, respectively, when it may, or must occur. Two other relations tell which pairs of paths may not, or must be confluent. We show that it is decidable whether some model of a path-automatic specification may be realized by some finite Petri net with transitions in bijection with the specified actions.