Affiliations: [a] LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, France. [email protected]
| [b] Pohang University of Science and Technology, South Korea. [email protected]
| [c] LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, France. [email protected]
| [d] University of Oslo, Norway. [email protected]
| [e] LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, France. [email protected]
Correspondence:
[*]
Address for correspondence: LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, France.
Abstract: This paper presents a concrete and a symbolic rewriting logic semantics for parametric time Petri nets with inhibitor arcs (PITPNs), a flexible model of timed systems where parameters are allowed in firing bounds. We prove that our semantics is bisimilar to the “standard” semantics of PITPNs. This allows us to use the rewriting logic tool Maude, combined with SMT solving, to provide sound and complete formal analyses for PITPNs. We develop and implement a new general folding approach for symbolic reachability, so that Maude-with-SMT reachability analysis terminates whenever the parametric state-class graph of the PITPN is finite. Our work opens up the possibility of using the many formal analysis capabilities of Maude—including full LTL model checking, analysis with user-defined execution strategies, and even statistical model checking—for such nets. We illustrate this by explaining how almost all formal analysis and parameter synthesis methods supported by the state-of-the-art PITPN tool Roméo can be performed using Maude with SMT. In addition, we also support analysis and parameter synthesis from parametric initial markings, as well as full LTL model checking and analysis with user-defined execution strategies. Experiments show that our methods outperform Roméo in many cases.
