A Game Approach to Determinize Timed Automata

Bertrand, Nathalie; Stainer, Amélie; Jéron, Thierry; Krichen, Moez

doi:10.1007/978-3-642-19805-2_17

Cited by 16 publications

(9 citation statements)

References 8 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us now briefly explain how to extend the previous construction to deal with ε-transitions and invariants. The extension is presented in details in [6].…”

Section: Extension To ε-Transitions and Invariantsmentioning

confidence: 99%

A game approach to determinize timed automata

Bertrand

Stainer

Jéron

et al. 2014

Form Methods Syst Des

Self Cite

View full text Add to dashboard Cite

Abstract. Timed automata are frequently used to model real-time systems. Their determinization is a key issue for several validation problems. However, not all timed automata can be determinized, and determinizability itself is undecidable. In this paper, we propose a game-based algorithm which, given a timed automaton with ε-transitions and invariants, tries to produce a language-equivalent deterministic timed automaton, otherwise a deterministic over-approximation. Our method subsumes two recent contributions: it is at once more general than the determinization procedure of [4] and more precise than the approximation algorithm of [11].

show abstract

“…Let us now briefly explain how to extend the previous construction to deal with ε-transitions and invariants. The extension is presented in details in [6].…”

Section: Extension To ε-Transitions and Invariantsmentioning

confidence: 99%

A game approach to determinize timed automata

Bertrand

Stainer

Jéron

et al. 2014

Form Methods Syst Des

Self Cite

View full text Add to dashboard Cite

show abstract

“…In addition, a game-based approach for determinizing timed automata has been proposed in [6,13]. This approach produces an equivalent deterministic timed automaton or a deterministic over-approximation, which allows one to enlarge the set of timed automata that can be automatically determinized compared to the one in [4].…”

Section: Related Workmentioning

confidence: 99%

“…This approach produces an equivalent deterministic timed automaton or a deterministic over-approximation, which allows one to enlarge the set of timed automata that can be automatically determinized compared to the one in [4]. In comparison, our approach could determinize timed automata which fail the boundedness condition in [4], and can cover the examples shown in [6]. The work is remotely related to work in [10].…”

Section: Related Workmentioning

confidence: 99%

Are Timed Automata Bad for a Specification Language? Language Inclusion Checking for Timed Automata

Wang

Sun

Liu

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Given a timed automaton P modeling an implementation and a timed automaton S as a specification, language inclusion checking is to decide whether the language of P is a subset of that of S. It is known that this problem is undecidable and "this result is an obstacle in using timed automata as a specification language" [2]. This undecidability result, however, does not imply that all timed automata are bad for specification. In this work, we propose a zone-based semi-algorithm for language inclusion checking, which implements simulation reduction based on Anti-Chain and LU-simulation. Though it is not guaranteed to terminate, we show that it does in many cases through both theoretical and empirical analysis. The semi-algorithm has been incorporated into the PAT model checker, and applied to multiple systems to show its usefulness and scalability.

show abstract

“…The technique presented in [7] applies first to TAs, i.e. the alphabet only consists of one kind of actions (say output actions), and the invariants are all trivial.…”

Section: 1mentioning

confidence: 99%

“…In the context of model-based testing, the above-mentioned determinization technique must be adapted to TAIOs, as detailed in [6], and summarized below. The model of TAIOs is an expressive model of timed automata incorporating internal actions and invariants.…”

Section: Extensions To Taios and Adaptation To Tiocomentioning

confidence: 99%

Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata

Bertrand

Jéron

Stainer

et al. 2011

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. This article proposes novel off-line test generation techniques from non-deterministic timed automata with inputs and outputs (TAIOs) in the formal framework of the tioco conformance theory. In this context, a first problem is the determinization of TAIOs, which is necessary to foresee next enabled actions after an observable trace, but is in general impossible because not all timed automata are determinizable. This problem is solved thanks to an approximate determinization using a game approach. The algorithm performs an io-abstraction which preserves the tioco conformance relation and thus guarantees the soundness of generated test cases. A second problem is the selection of test cases from a TAIO specification. The selection here relies on a precise description of timed behaviors to be tested which is carried out by expressive test purposes modeled by a generalization of TAIOs. Finally, an algorithm is described which generates test cases in the form of TAIOs equipped with verdicts, using a symbolic co-reachability analysis guided by the test purpose. Properties of test cases are then analyzed with respect to the precision of the approximate determinization: when determinization is exact, which is the case on known determinizable classes, in addition to soundness, properties characterizing the adequacy of test cases verdicts are also guaranteed.

show abstract

A Game Approach to Determinize Timed Automata

Cited by 16 publications

References 8 publications

A game approach to determinize timed automata

A game approach to determinize timed automata

Are Timed Automata Bad for a Specification Language? Language Inclusion Checking for Timed Automata

Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata

Contact Info

Product

Resources

About