Liveness in timed and untimed systems

Gawlick, Rainer; Segala, Roberto; Søgaard-Andersen, Jørgen F.; Lynch, Nancy

doi:10.1007/3-540-58201-0_66

Cited by 58 publications

(61 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper is a rst step towards a theory of testing for timed automata. We propose a model of timed I O automata, which borrows ideas from both Alur and Dill's model and from the timed I O automata of Lynch et al GSSL94 . Apart from supporting the automatic generation of timed tests, our model allows a loose coupling of inputs and outputs, unlike the usual Mealy style nite state machines where inputs and outputs occur simultaneously in a single transition.…”

Section: Introductionmentioning

confidence: 99%

A calculus for timed automata

D’Argenio

Brinksma

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present a generalization of the classical theory of testing for Mealy machines to a setting of dense real-time systems. A model of timed I O automata is introduced, inspired by the timed automaton model of Alur and Dill, together with a notion of test sequence for this model. Our main contribution is a test generation algorithm for black-box conformance testing of timed I O automata. Although it is highly exponential and cannot be claimed to be of practical value, it is the rst algorithm that yields a nite and complete set of tests for dense real-time systems.

show abstract

Section: Introductionmentioning

confidence: 99%

A calculus for timed automata

D’Argenio

Brinksma

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In fact, the definition of I/O automata given here corresponds to I/O automata that are called unfair [7] or safe [22]. Consequently, also the notion of strong compatibility-by which no action may belong to infinitely many components-is not significant to our exposition.…”

Section: Discussionmentioning

confidence: 99%

“…I/O automata can be composed using a synchronous product construction yielding a new I/O automaton. Since their introduction I/O automata have been augmented with, e.g., time and probability [18,21] and, together with its many variants, the model is now widely used for describing reactive, distributed systems [6][7][8][9][10][11][12][13][16][17][18][19][20][21][22][23].…”

Section: Introductionmentioning

confidence: 99%

Modularity for teams of I/O automata

Beek

Kleijn

2005

Information Processing Letters

View full text Add to dashboard Cite

show abstract

“…Automata satisfying this operational requirement are called nonZeno. The interested reader is referred to [1,29,11].…”

Section: Remark 1 (Nonzenoness)mentioning

confidence: 99%

Timed Automata

Alur

1999

Computer Aided Verification

265

175

View full text Add to dashboard Cite

Abstract. Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of real-time systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of real-time systems. Its definition provides a simple way to annotate state-transition graphs with timing constraints using finitely many real-valued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits and logic, and much progress has been made in developing verification algorithms, heuristics, and tools. This paper provides a survey of the theory of timed automata, and their role in specification and verification of real-time systems. ModelingTransition systems. We model discrete systems by state-transition graphs whose transitions are labeled with event symbols. A transition system S is a tuple Q, Q 0 , Σ, → , where Q is a set of states, Q 0 ⊆ Q is a set of initial states, Σ is a set of labels (or events), and →⊆ Q × Σ × Q is a set of transitions. The system starts in an initial state, and if q a → q then the system can change its state from q to q on event a. We write q → q if q a → q for some label a. The state q is reachable from the state q if q → * q . The state q is a reachable state of the system if q is reachable from some initial state.A complex system can be described as a product of interacting transition systems. Letand q 1 a → 1 q 1 and q 2 = q 2 , or (iii) a ∈ Σ 2 \ Σ 1 and q 2 a → 2 q 2 and q 1 = q 1 . Observe that the symbols that belong to the alphabets of both the automata are used for synchronization.

show abstract

Liveness in timed and untimed systems

Cited by 58 publications

References 12 publications

A calculus for timed automata

A calculus for timed automata

Modularity for teams of I/O automata

Timed Automata

Contact Info

Product

Resources

About