Model-Checking in Dense Real-Time

Alur, Rajeev; Courcoubetis, Costas; Dill, David L.

doi:10.1006/inco.1993.1024

Cited by 662 publications

(464 citation statements)

References 24 publications

Supporting

Mentioning

454

Contrasting

Unclassified

Order By: Relevance

“…At least two different timed extensions of the branching time logic CTL [9,13,8] have been proposed. The first one [1] adds subscripts to the U operator while the second one considers formula clocks [10]. Model checking timed automata was proved decidable in both cases and compared expressiveness has been revisited later on [6].…”

Section: Interrupt Timed Automata and Timed Logicsmentioning

confidence: 99%

“…If this fails, it non deterministically guesses a path ρ of length less than or equal to twice the bound, in which from some step (say the zth step), r never holds, and which ends by a sub-path eσe where e is a transition of level k and σ a path containing states of level greater than or equal to k. Then the procedure is based on the previous case study. 1. If e updates x k or eσ does not let time elapse for x k , then by repeating σe indefinitely, we would obtain an infinite path ρ in which r never holds from a certain point on.…”

Section: A5 Proof Of Lemma 3 (Case 4)mentioning

confidence: 99%

“…This model is very expressive but it was proved that, even when the only variables are stopwatches, with rate equal to 0 or 1, reachability is undecidable [7]. On the other hand, restricting the variables to clocks, with rate 1, yields the well known model of Timed Automata (TA) where several verification question are decidable, in particular model checking TCTL [1], a timed extension of the temporal logic CTL [9,13]. Various classes have then been proposed between timed and hybrid automata, with the aim to keep a high expressive power together with decidable verification problems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Interrupt Timed Automata

Bérard

Haddad

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. The class of Interrupt Timed Automata (ITA) has been introduced to model multi-task systems with interruptions in a single processor environment. This is a subclass of hybrid automata in which real valued variables consist of a restricted type of stopwatches (variables with rate 0 or 1) organized along levels. While reachability is undecidable with usual stopwatches, it was proved that this problem is decidable in ITA and that untimed languages of ITA are effectively regular. Here we investigate the problem of model checking timed extensions of CTL over ITA and show in contrast that this problem is undecidable. On the other hand, we prove that model checking is decidable for two relevant fragments of this timed logic: (1) the first one where formula contain only model clocks and (2) the second one where formulas have a single external clock.

show abstract

Section: Interrupt Timed Automata and Timed Logicsmentioning

confidence: 99%

Section: A5 Proof Of Lemma 3 (Case 4)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Interrupt Timed Automata

Bérard

Haddad

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

show abstract

“…Inspired by the success of real-time modelcheckers such as Kronos [14] and Uppaal [30], the direction taken is that of automatic verification through model checking, adapting the formalisms and algorithms for model-checking of classical (non-probabilistic) timed systems [2] to the case of timed probabilistic systems. Within this approach 1 , timed probabilistic systems are modelled as probabilistic timed automata [1,28], i.e.…”

Section: Introductionmentioning

confidence: 99%

Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM

Daws

Kwiatkowska

Norman

2004

STTT

View full text Add to dashboard Cite

Abstract. We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time model-checker Kronos and the probabilistic model-checker Prism. The system is modelled as a probabilistic timed automaton. We first use Kronos to perform a symbolic forward reachability analysis to generate the set of states that are reachable with non-zero probability from the initial state, and before the deadline expires. We then encode this information as a Markov decision process to be analyzed with Prism. We apply this technique to compute the minimal probability of a leader being elected before a deadline, for different deadlines, and study how this minimal probability is influenced by using a biased coin and considering different wire lengths.

show abstract

“…The region graph constructions used in model checking such systems is already a form of abstraction [ACD93]. Colón and Uribe [CU98,Uri98] carried out a verification of a two-process instance of Fischer's real time mutual exclusion protocol using predicate abstraction.…”

Section: Abstracting Timed and Hybrid Systemsmentioning

confidence: 99%

Verification by Abstraction

Shankar

2003

Formal Methods at the Crossroads. From Panacea to Foundational Support

View full text Add to dashboard Cite

Abstract. Verification seeks to prove or refute putative properties of a given program. Deductive verification is carried out by constructing a proof that the program satisfies its specification, whereas model checking uses state exploration to find computations where the property fails. Model checking is largely automatic but is effective only for programs defined over small state spaces. Abstraction serves as a bridge between the more general deductive methods for program verification and the restricted but effective state exporation methods used in model checking. In verification by abstraction, deduction is used to construct a finitestate approximation of a program that preserves the property of interest. The resulting abstraction can be explored for offending computations through the use of model checking. We motivate the use of abstraction in verification and survey some of the recent advances.

show abstract

Model-Checking in Dense Real-Time

Cited by 662 publications

References 24 publications

Interrupt Timed Automata

Interrupt Timed Automata

Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM

Verification by Abstraction

Contact Info

Product

Resources

About