Unbounded Petri Net Synthesis

13 years 9 months ago

Download www.irisa.fr

We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable markings may be inﬁnite.

Philippe Darondeau

Real-time Traffic

AC 2003 | Software Engineering | Unlabelled Place-transition Nets |

claim paper

Related Content

» A Petri Net Synthesis Method

» A structural encoding technique for the synthesis of asynchronous circuits

» A Symbolic Algorithm for the Synthesis of Bounded Petri Nets

» How to synthesize nets from languages a survey

» Computing Optimal Coverability Costs in Priced Timed Petri Nets

» Diagnosability analysis of unbounded Petri nets

» A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms

» Petri nets design based on neural networks

» Variants of the Language Based Synthesis Problem for Petri Nets

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	AC
Authors	Philippe Darondeau

Comments (0)

Sciweavers

Unbounded Petri Net Synthesis

AC 2003 | Software Engineering | Unlabelled Place-transition Nets |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers