Skip to Main content Skip to Navigation
Conference papers

Difference Bound Constraint Abstraction for Timed Automata Reachability Checking

Abstract : We consider the reachability problem for timed automata. One of the most well-known solutions for this problem is the zone-based search method. Max bound abstraction and LU-bound abstraction on zones have been proposed to reduce the state space for zone based search. These abstractions use bounds collected from the timed automata structure to compute an abstract state space. In this paper we propose a difference bound constraint abstraction for zones. In this abstraction, sets of difference bound constraints collected from the symbolic run are used to compute the abstract states. Based on this new abstraction scheme, we propose an algorithm for the reachability checking of timed automata. Experiment results are reported on several timed automata benchmarks.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01767323
Contributor : Hal Ifip <>
Submitted on : Monday, April 16, 2018 - 10:18:31 AM
Last modification on : Friday, April 12, 2019 - 11:32:01 AM

File

978-3-319-19195-9_10_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Weifeng Wang, Li Jiao. Difference Bound Constraint Abstraction for Timed Automata Reachability Checking. 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2015, Grenoble, France. pp.146-160, ⟨10.1007/978-3-319-19195-9_10⟩. ⟨hal-01767323⟩

Share

Metrics

Record views

81

Files downloads

338