Static Detection of Zeno Runs in UPPAAL Networks Based on Synchronization Matrices and Two Data-Variable Heuristics

Rinast, Jonas; Schupp, Sibylle

doi:10.1007/978-3-642-33365-1_16

Cited by 3 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem of checking existence of zeno runs was formulated as early as in [Tri99]. A bulk of the literature for this problem also directs to [GB07,CY92,RS12]. All of these solutions provide a sufficient-only condition for the absence of zeno runs.…”

Section: Introductionmentioning

confidence: 99%

Finding minimum and maximum termination time of timed automata models with cyclic behaviour

Al-Bataineh

Reynolds

French

2017

Theoretical Computer Science

View full text Add to dashboard Cite

The paper presents a novel algorithm for computing worst case execution time (WCET) or maximum termination time of real-time systems using the timed automata (TA) model checking technology. The algorithm can work on any arbitrary diagonal-free TA and can handle more cases than previously existing algorithms for WCET computation, as it can handle cycles in TA and decide whether they lead to an infinite WCET. We show soundness of the proposed algorithm and study its complexity. To our knowledge, this is the first model checking algorithm that addresses comprehensively the WCET problem of systems with cyclic behaviour. In [BFH + 01] Behrmann et al provide an algorithm for computing the minimum cost/time of reaching a goal state in priced timed automata (PTA). The algorithm has been implemented in the well-known model checking tool UPPAAL to compute the minimum time for termination of an automaton. However, we show that in certain circumstances, when infinite cycles exist, the algorithm implemented in UPPAAL may not terminate, and we provide examples which UPPAAL fails to verify.

show abstract

Section: Introductionmentioning

confidence: 99%

Finding minimum and maximum termination time of timed automata models with cyclic behaviour

Al-Bataineh

Reynolds

French

2017

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The problem of checking existence of Zeno runs was formulated as early as in [18]. A bulk of the literature for this problem also directs to [10,6,17]. All of these solutions provide a sufficient-only condition for the absence of Zeno runs.…”

Section: Introductionmentioning

confidence: 99%

Coarse abstractions make Zeno behaviours difficult to detect

Herbreteau¹,

Srivathsan²

2013

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find runs that are non-Zeno. Over the years important improvements have been obtained in checking reachability properties for timed automata. We show that some of these very efficient optimizations make testing for Zeno runs costly. In particular we show NP-completeness for the LU-extrapolation of Behrmann et al. We analyze the source of this complexity in detail and give general conditions on extrapolation operators that guarantee a (low) polynomial complexity of Zenoness checking. We propose a slight weakening of the LU-extrapolation that satisfies these conditions.

show abstract

Modular Verification of Vehicle Platooning with Respect to Decisions, Space and Time

Kamali¹,

Linker

Fisher

2019

Communications in Computer and Information Science

View full text Add to dashboard Cite

The spread of autonomous systems into safety-critical areas has increased the demand for their formal verification, not only due to stronger certification requirements but also to public uncertainty over these new technologies. However, the complex nature of such systems, for example, the intricate combination of discrete and continuous aspects, ensures that whole system verification is often infeasible. This motivates the need for novel analysis approaches that modularise the problem, allowing us to restrict our analysis to one particular aspect of the system while abstracting away from others. For instance, while verifying the real-time properties of an autonomous system we might hide the details of the internal decision-making components. In this paper we describe verification of a range of properties across distinct dimesnions on a practical hybrid agent architecture. This allows us to verify the autonomous decision-making, real-time aspects, and spatial aspects of an autonomous vehicle platooning system. This modular approach also illustrates how both algorithmic and deductive verification techniques can be applied for the analysis of different system subcomponents.

show abstract

Static Detection of Zeno Runs in UPPAAL Networks Based on Synchronization Matrices and Two Data-Variable Heuristics

Cited by 3 publications

References 25 publications

Finding minimum and maximum termination time of timed automata models with cyclic behaviour

Finding minimum and maximum termination time of timed automata models with cyclic behaviour

Coarse abstractions make Zeno behaviours difficult to detect

Modular Verification of Vehicle Platooning with Respect to Decisions, Space and Time

Contact Info

Product

Resources

About