Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems

Kaynar, Dilsun; Lynch, Nancy; Segala, Roberto; Vaandrager, Frits

doi:10.1109/real.2003.1253264

Cited by 67 publications

(66 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We refer the reader to [10] for a complete description of the mathematical framework, and to [8] for the TIOA user guide and reference manual.…”

Section: Tioa Mathematical Model and Languagementioning

confidence: 99%

“…As shown in [10], the result of composing two timed automata is guaranteed to be a timed automaton. An external action a of the composition is classified as an output action if a is an output of one of the component automata.…”

Section: T C_ Trajs(x)mentioning

confidence: 99%

“…Otherwise, a is an input action. As shown in [10], the composition of two timed I/O automata is guaranteed to be a timed I/O automaton.…”

Section: T C_ Trajs(x)mentioning

confidence: 99%

“…The timed input/output automaton [10,9] modeling framework is a mathematical framework for compositional modeling and analysis of systems that involve discrete and continuous evolution. The state of a timed I/O automaton changes discretely through actions, and continuously over time intervals through trajectories.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Lim

Kaynar

Lynch

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The timed input/output automaton modeling framework is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its statetransition based description has to be translated to the language of the theorem prover. This thesis describes a tool for translating from TIOA, the formal language for describing timed input/output automata, to the language of the Prototype Verification System (PVS)--a specification system with an integrated interactive theorem prover. We describe the translation scheme, discuss the design decisions, and briefly present case studies to illustrate the application of the translator in the verification process.

show abstract

“…We refer the reader to [10] for a complete description of the mathematical framework, and to [8] for the TIOA user guide and reference manual.…”

Section: Tioa Mathematical Model and Languagementioning

confidence: 99%

Section: T C_ Trajs(x)mentioning

confidence: 99%

“…Otherwise, a is an input action. As shown in [10], the composition of two timed I/O automata is guaranteed to be a timed I/O automaton.…”

Section: T C_ Trajs(x)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Lim

Kaynar

Lynch

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…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

Verifying Average Dwell Time by Solving Optimization Problems

Mitra

Lynch

Liberzon

2006

Hybrid Systems: Computation and Control

View full text Add to dashboard Cite

Abstract. In the switched system model, discrete mechanisms of a hybrid system are abstracted away in terms of an exogenous switching signal which brings about the mode switches. The Average Dwell time (ADT) property defines restricted classes of switching signals which provide sufficient conditions for proving stability of switched systems. In this paper, we use a specialization of the Hybrid I/O Automaton model to capture both the discrete and the continuous mechanisms of hybrid systems. Based on this model, we develop methods for automatically verifying ADT properties and present simulation relations for establishing equivalence of hybrid systems with respect to ADT. Given a candidate ADT for a hybrid system, we formulate an optimization problem; a solution of this problem either establishes the ADT property or gives an execution fragment of the system that violates it. For two special classes of hybrid systems, we show that the corresponding optimization problems can be solved using standard mathematical programming techniques. We formally define equivalence of two hybrid systems with respect to ADT and present a simulation relation-based method for proving this equivalence. The proposed methods are applied to verify ADT properties of a linear hysteresis switch and a nondeterministic thermostat.

show abstract

Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems

Cited by 67 publications

References 20 publications

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Modularity for teams of I/O automata

Verifying Average Dwell Time by Solving Optimization Problems

Contact Info

Product

Resources

About