When proving the correctness of algorithms in distributed systems, one generally consid-ers safety conditions and liveness conditions. The Input/Output (I/O) automaton model and its timed version have been used successfully, but have focused on safety conditions and on a restricted form of liveness called fairness. In this paper we develop a new I/O automa-ton model, and a new timed I/O automaton model, that permit the verification of general liveness properties on the basis of existing verification techniques. Our models include a notion of receptiveness which extends the idea of receptiveness of other existing formalisms, and enables the use of compositional verication techniques. The presentation includes an embedding of the untimed mode...
I/O conformance testing theories (e.g., ioco) are concerned with formally defining when observable o...
Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch &...
International audienceThis chapter surveys timed automata as a formalism for model checking real-tim...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
International audienceThe liveness problem for timed automata asks if a given automaton has a run pa...
The increasing use of model-based tools enables further use of formal verification techniques in the...
. We consider the timed automata model of [3], which allows the analysis of real-time systems expres...
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for m...
We consider the problem of verifying liveness for systems with a finite, but unbounded, number of pr...
Abstract In real-time systems, correctness depends on the time at which events occur. Examples of re...
AbstractUsing an automata-theoretic approach, we investigate the decidability of liveness properties...
Computer Science is currently facing a grand challenge :finding good design practices for embedded s...
Software is finding its way into an increasing range of devices (phones, medical equipment, cars...)...
Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch &...
Formal methods are mathematical techniques that enable the rigorous specification and verification o...
I/O conformance testing theories (e.g., ioco) are concerned with formally defining when observable o...
Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch &...
International audienceThis chapter surveys timed automata as a formalism for model checking real-tim...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
International audienceThe liveness problem for timed automata asks if a given automaton has a run pa...
The increasing use of model-based tools enables further use of formal verification techniques in the...
. We consider the timed automata model of [3], which allows the analysis of real-time systems expres...
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for m...
We consider the problem of verifying liveness for systems with a finite, but unbounded, number of pr...
Abstract In real-time systems, correctness depends on the time at which events occur. Examples of re...
AbstractUsing an automata-theoretic approach, we investigate the decidability of liveness properties...
Computer Science is currently facing a grand challenge :finding good design practices for embedded s...
Software is finding its way into an increasing range of devices (phones, medical equipment, cars...)...
Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch &...
Formal methods are mathematical techniques that enable the rigorous specification and verification o...
I/O conformance testing theories (e.g., ioco) are concerned with formally defining when observable o...
Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch &...
International audienceThis chapter surveys timed automata as a formalism for model checking real-tim...