Sciweavers

AC
2003
Springer

Unbounded Petri Net Synthesis

14 years 14 days ago
Unbounded Petri Net Synthesis
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 infinite.
Philippe Darondeau
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where AC
Authors Philippe Darondeau
Comments (0)