Sciweavers

AC
2003
Springer
13 years 9 months 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 marking...
Philippe Darondeau