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.

• Type: Conference
• Year: 2003
• Where: AC
• Authors: Philippe Darondeau
• Keywords: AC 2003, Software Engineering, Unlabelled Place-transition Nets