Difference Bound Constraint Abstraction for Timed Automata Reachability Checking

DOI10.1007/978-3-319-19195-9_10zbMath1347.68242OpenAlexW2118964795MaRDI QIDQ2827453

Weifeng Wang, Li Jiao

Publication date: 19 October 2016

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01767323/file/978-3-319-19195-9_10_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Configurable verification of timed automata with discrete variables ⋮ Lazy Reachability Checking for Timed Automata with Discrete Variables

This page was built for publication: Difference Bound Constraint Abstraction for Timed Automata Reachability Checking