The theory of timed I/O automata
By: Dilsun K. Kaynar ... [et al.].
Edition: 2nd ed.
Series: Synthesis lectures on distributed computing theory -- # 5
Publisher: Morgan & Claypool
Published: 2011
Place of publication: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA)
Language: eng
Format: [electronic resource] /
Number of pages: 138
ISBN-13: 9781608450039; 9781608450022
Subjects: Mathematical models; Temporal automata
Other titles: Synthesis digital library of engineering and computer science.
Description: This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, real-time operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability requirements, which make it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior.
Notes: Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 105-117) and index.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Also available in print.

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.
Table of contents: title: 1. Introduction; title: Overview; title: Evolution of the TIOA framework; title: Related work; title: Organization of the book; title: 2. Mathematical preliminaries; title: Functions and relations; title: Sequences; title: Partial orders; title: A basic graph Lemma; title: 3. Describing timed system behavior; title: Time; title: Static and dynamic types; title: Trajectories; title: Basic definitions; title: Prefix ordering; title: Concatenation; title: Hybrid sequences; title: Basic definitions; title: Prefix ordering; title: Concatenation; title: Restriction; title: 4. Timed automata; title: Definition of timed automata; title: Executions and traces; title: Invariants; title: Special kinds of timed automata; title: Implementation relationships; title: Simulation relations; title: Forward simulations; title: Refinements; title: Backward simulations; title: History relations; title: Prophecy relations; title: 5. Operations on timed automata; title: Composition; title: Definitions and basic results; title: Substitutivity results; title: Hiding; title: Extending timed automata with bounds; title: 6. Properties for timed automata; title: Properties for hybrid sequences; title: Properties for timed automata; title: Implementation; title: Operations; title: 7. Timed I/O automata; title: Definition of timed I/O automata; title: Executions and traces; title: Special kinds of timed I/O automata; title: Feasible and I/O feasible TIOAs; title: Progressive TIOAs; title: Receptive timed I/O automata; title: Implementation relationships; title: Simulation relations; title: 8. Operations on timed I/O automata; title: Composition; title: Definitions and basic results; title: Substitutivity results; title: Composition of special kinds of TIOAs; title: Hiding; title: 9. Conclusions and future work; title: Bibliography; title: Authors' biographies; title: Index.