4 research outputs found
Fast algorithms for handling diagonal constraints in timed automata
A popular method for solving reachability in timed automata proceeds by
enumerating reachable sets of valuations represented as zones. A na\"ive
enumeration of zones does not terminate. Various termination mechanisms have
been studied over the years. Coming up with efficient termination mechanisms
has been remarkably more challenging when the automaton has diagonal
constraints in guards.
In this paper, we propose a new termination mechanism for timed automata with
diagonal constraints based on a new simulation relation between zones.
Experiments with an implementation of this simulation show significant gains
over existing methods.Comment: Shorter version of this article to appear in CAV 201
Computer Aided Verification
This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency