On Petri Nets and Predicate-Transition Nets

Petri nets are used to study many types of networked systems. [1] have designed a software tool for analysis and simulation of Petri nets. We extend this tool to handle a form of Petri net known as Predicate Transition (PrT) nets. We implement mechanisms that automate the process of folding a Petri net to a PrT net and finding invariants. We can compute invariants for systems that use either Petri net or the extended PrT net. Invariants are required to prove certain properties of the system being modeled, such as liveness and safety. Finally, for Petri net, we use the invariants to prove these two properties.