Model checking of timed automata is a widely used technique. But in order to take advantage of modern hardware, the algorithms need to be parallelized.

We present a multi-core reachability algorithm for the more general class of well-structured transition systems, and an implementation for timed automata. ... The ...

Multi-core Reachability for Timed Automata. 93 input graph (unlike their BFS-based counterparts). While these algorithms are heuristic in nature, their ...

Model checking of timed automata is a widely used technique. But in order to take advantage of modern hardware, the algorithms need to be parallelized.

Multi-Core Reachability for Timed Automata. Andreas Dalsgaard2. Alfons Laarman1. Kim G. Larsen2. Mads Chr. Olesen2. Jaco van de Pol1. 1Formal Methods and Tools ...

In this paper, we prove the decidability of the minimal and maximal reachability problems for multi-priced timed automata, an extension of timed automata ...

Sep 18, 2012 · We present a multi-core reachability algorithm for the more general class of well-structured transition systems, and an implementation for timed ...

Jul 25, 2024 · In this paper we treat observers that have both positive and negative rates. Our main result is an algorithm to decide a gap version of the reachability ...

Sep 18, 2012 · We present a multi-core reachability algorithm for the more general class of well-structured transition systems, and an implementation for timed ...

In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time ...