# Improved Bounded Model Checking of Timed Automata

@article{Smith2021ImprovedBM, title={Improved Bounded Model Checking of Timed Automata}, author={Robert L. Smith and Marcello M. Bersani and Matteo Rossi and Pierluigi San Pietro}, journal={2021 IEEE/ACM 9th International Conference on Formal Methods in Software Engineering (FormaliSE)}, year={2021}, pages={97-110} }

Timed Automata (TA) are a very popular modeling formalism for systems with time-sensitive properties. A common task is to verify if a network of TA satisfies a given property, usually expressed in Linear Temporal Logic (LTL), or in a subset of Timed Computation Tree Logic (TCTL). In this paper, we build upon the TACK bounded model checker for TA, which supports a signal-based semantics of TA and the richer Metric Interval Temporal Logic (MITL). TACK encodes both the TA network and property into…

## Figures and Tables from this paper

## References

SHOWING 1-10 OF 24 REFERENCES

### Model Checking MITL formulae on Timed Automata: a Logic-Based Approach

- 2020

Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used…

### Bounded Model Checking of an MITL Fragment for Timed Automata

- Computer Science2013 13th International Conference on Application of Concurrency to System Design
- 2013

This paper extends the semantics of a fragment of MITL to super-dense time traces and devise a bounded model checking encoding for the fragment and proves correctness and completeness in the sense that using a sufficiently large bound a counter-example to any given non-holding property can be found.

### Model-checking for real-time systems

- Computer Science[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
- 1990

An algorithm is developed for model checking, that is, for determining the truth of a TCTL formula with respect to a timed graph, and it is argued that choosing a dense domain, instead of a discrete domain, to model time does not blow up the complexity of the model-checking problem.

### A tool for deciding the satisfiability of continuous-time metric temporal logic

- Computer Science2013 20th International Symposium on Temporal Representation and Reasoning
- 2013

Satisfiability of CLTL over clocks is here shown to be decidable by means of a reduction to a decidable Satisfiability Modulo Theories (SMT) problem, which has been implemented by using standard SMT solvers.

### Principles of model checking

- Computer Science
- 2008

Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.

### On How Bit-Vector Logic Can Help Verify LTL-Based Specifications

- Computer ScienceIEEE Transactions on Software Engineering
- 2022

This paper studies how bit-vector logic (bv logic) can help improve the efficiency of verifying specifications expressed in Linear Temporal Logic (LTL). First, it exploits the notion of Bounded…

### The benefits of relaxing punctuality

- Computer SciencePODC '91
- 1991

A temporal language is introduced that can constrain the time difference between events only with finite (yet arbitrary) precision and show the resulting logic to be EXPACE-complete, allowing the authors to develop an algorithm for the verification of timing properties of real time systems with a dense semantics.