Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving

03/15/2023
by   Jaime Arias, et al.
0

Parametric time Petri nets with inhibitor arcs (PITPNs) support flexibility for timed systems by allowing parameters in firing bounds. In this paper we present and prove correct a concrete and a symbolic rewriting logic semantics for PITPNs. We show how this allows us to use Maude combined with SMT solving to provide sound and complete formal analyses for PITPNs. We develop a new general folding approach for symbolic reachability that terminates whenever the parametric state-class graph of the PITPN is finite. We explain how almost all formal analysis and parameter synthesis supported by the state-of-the-art PITPN tool Roméo can be done in 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 on three benchmarks show that our methods outperform Roméo in many cases.

READ FULL TEXT

page 27

page 29

research
02/28/2023

SMPT: A Testbed for Reachability Methods in Generalized Petri Nets

SMPT (for Satisfiability Modulo Petri Net) is a model checker for reacha...
research
02/17/2020

An SMT-Based Concolic Testing Tool for Logic Programs

Concolic testing mixes symbolic and concrete execution to generate test ...
research
07/09/2020

Symbolic Reachability Analysis of High Dimensional Max-Plus Linear Systems

This work discusses the reachability analysis (RA) of Max-Plus Linear (M...
research
07/14/2022

Parameter Synthesis in Markov Models: A Gentle Survey

This paper surveys the analysis of parametric Markov models whose transi...
research
05/18/2018

Reachability Analysis for Spatial Concurrent Constraint Systems with Extrusion

Spatial concurrent constraint programming (SCCP) is an algebraic model o...
research
07/12/2019

Augmenting Neural Nets with Symbolic Synthesis: Applications to Few-Shot Learning

We propose symbolic learning as extensions to standard inductive learnin...
research
10/31/2019

Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond

In previous studies, several methods have been developed to synthesise P...

Please sign up or login with your details

Forgot password? Click here to reset