Conceitos Básicos
This paper presents a rewriting logic semantics and a symbolic analysis framework for parametric time Petri nets with inhibitor arcs, enabling sound and complete formal analyses including reachability, liveness, temporal logic model checking, and parameter synthesis.
Resumo
The paper presents a concrete and a symbolic rewriting logic semantics for parametric time Petri nets with inhibitor arcs (PITPNs). The concrete semantics models the behavior of instantiated PITPNs, while the symbolic semantics captures the behavior of parametric PITPNs.
The key highlights and insights are:
The concrete semantics is shown to be bisimilar to the "standard" semantics of PITPNs, allowing the use of Maude and SMT solving for formal analysis.
A new general folding approach for symbolic reachability analysis is developed, ensuring termination whenever the parametric state-class graph of the PITPN is finite.
The Maude-with-SMT framework supports a wide range of formal analyses, including reachability, liveness, full LTL model checking, analysis with user-defined execution strategies, and parameter synthesis. These capabilities go beyond what is supported by the state-of-the-art PITPN tool Roméo.
Experiments show that the Maude-with-SMT methods often outperform Roméo, and can find solutions in cases where Roméo answers "maybe".
The rewriting logic semantics and analysis framework are formalized and implemented in Maude itself, making it easy to develop and prototype new analysis methods for PITPNs.