Extending nuXmv with Timed Transition Systems and Timed Temporal Properties

Cimatti, Alessandro; Griggio, Alberto; Magnago, Enrico; Roveri, Marco; Tonetta, Stefano

doi:10.1007/978-3-030-25540-4_21

Cited by 23 publications

(12 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first approach that we present transforms a temporal planning problem P into an equivalent NUXMV model with clocks, which is a symbolic representation of a Timed Transition System (TTS) (Cimatti et al 2019).…”

Section: Model-checking Decision Procedures For Tpmentioning

confidence: 99%

“…We propose two novel terminating approaches: the first approach is a reduction to model-checking, which encodes the problem in a symbolic timed transition system (Cimatti et al 2019) and uses the NUXMV (Cavada et al 2014) model-checker; the second approach is a dedicated Forward-Chaining Temporal Planner called TAMER-CTP, which combines a heuristic-search schema inspired by (Valentini, Micheli, and Cimatti 2020) with a symbolic representation of time using Difference Bound Matrices (DBM).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping

Panjkovic

Micheli

Cimatti

2022

AAAI

Self Cite

View full text Add to dashboard Cite

The field of Temporal Planning (TP) is receiving increasing interest for its many real-world applications. Most of the literature focuses on the TP problem of finding a plan, with algorithms that are not guaranteed to terminate when the problem admits no solution. In this paper, we present sound and complete decision procedures that address the dual problem of proving that no plan exists, which has important applications in oversubscription, model validation and optimization. We focus on the expressive and practically relevant semantics of action non-self-overlapping, recently proved to be PSPACE-complete. For this subclass, we propose two approaches: a reduction of the planning problem to model-checking of Timed Transition Systems, and a heuristic-search algorithm where temporal constraints are represented by Difference Bound Matrices. We implemented the approaches, and carried out an experimental evaluation against other state-of-the-art TP tools. On benchmarks that admit no plans, both approaches dramatically outperform the other planners, while the heuristic-search algorithm remains competitive on solvable benchmarks.

show abstract

Section: Model-checking Decision Procedures For Tpmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping

Panjkovic

Micheli

Cimatti

2022

AAAI

Self Cite

View full text Add to dashboard Cite

show abstract

“…In contrast, for example, [PLK18] requires an additional constraint, called a blocking constraint, to generate various signals. Nevertheless, the use of SMT in the analysis of an automaton (much like nuXmv [Cim+19]) is future work. In addition, most of these works utilize MITL [MNP06], STL [MN04], or an extension of regular expressions.…”

Section: Related Workmentioning

confidence: 99%

Exemplifying parametric timed specifications over signals with bounded behavior

André,

Waga,

Urabe

et al. 2022

Preprint

View full text Add to dashboard Cite

Specifying properties can be challenging work. In this paper, we propose an automated approach to exemplify properties given in the form of automata extended with timing constraints and timing parameters, and that can also encode constraints over real-valued signals. That is, given such a specification and given an admissible automaton for each signal, we output concrete runs exemplifying real (or impossible) runs for this specification. Specifically, our method takes as input a specification, and a set of admissible behaviors, all given as a subclass of rectangular hybrid automata, namely timed automata extended with arbitrary clock rates, signal constraints, and timing parameters. Our method then generates concrete runs exemplifying the specification.

show abstract

“…The work of [2] also addresses the parameter synthesis to avoid deadlocks in timed automata. In order to check for livelocks, liveness properties can be addressed with approaches proposed in [10,7]. A general definition of illegal states for timed interface automata is given in [13].…”

Section: Related Workmentioning

confidence: 99%

“…We implemented the SMT-based approach in a tool called TRICker and carried out experimental evaluation, comparing it with other tools for the verifica-tion of timed automata. We used Uppaal [6] and nuXmv [7] to model check TAs and MathSAT [12] to solve the SMT problems. We performed an experimental evaluation based on a test-set of randomly generated local requirements.…”

Section: Introductionmentioning

confidence: 99%

Safe Decomposition of Startup Requirements: Verification and Synthesis

Cimatti

Geatti

Griggio

et al. 2020

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

The initialization of complex cyber-physical systems often requires the interaction of various components that must start up with strict timing requirements on the provision of signals (power, refrigeration, light, etc.). In order to safely allow an independent development of components, it is necessary to ensure a safe decomposition, i.e. the specification of local timing requirements that prevent later integration errors due to the dependencies. We propose a high-level formalism to model local timing requirements and dependencies. We consider the problem of checking the consistency (existence of an execution satisfying the requirements) and compatibility (absence of an execution that reaches an integration error) of the local requirements, and the problem of synthesizing a region of timing constraints that represents all possible correct refinements of the original specification. We show how the problems can be naturally translated into a model checking and synthesis problem for timed automata with shared variables. Exploiting the linear structure of the requirements, we propose an encoding of the problem into SMT. We evaluate the SMTbased approach using MathSAT and show how it scales better than the automata-based approach using Uppaal and nuXmv.

show abstract

Extending nuXmv with Timed Transition Systems and Timed Temporal Properties

Cited by 23 publications

References 22 publications

Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping

Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping

Exemplifying parametric timed specifications over signals with bounded behavior

Safe Decomposition of Startup Requirements: Verification and Synthesis

Contact Info

Product

Resources

About