The theory of timed I/O automata
Contributor(s): Kaynar, Dilsun K.
Material type:
BookSeries: Synthesis digital library of engineering and computer science: ; Synthesis lectures on distributed computing theory: # 5.Publisher: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, c2011Edition: 2nd ed.Description: 1 electronic text (xiv, 123 p.) : ill., digital file.ISBN: 9781608450039 (electronic bk.).Subject(s): Temporal automata -- Mathematical models | Timed computing systems | Distributed algorithms | Formal modeling and verification | I/O automataDDC classification: 511.3 Online resources: Abstract with links to resource Also available in print.| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
E books
|
PK Kelkar Library, IIT Kanpur | Available | EBKE300 |
Mode of access: World Wide Web.
System requirements: Adobe Acrobat Reader.
Part of: Synthesis digital library of engineering and computer science.
Series from website.
Includes bibliographical references (p. 105-117) and index.
1. Introduction -- Overview -- Evolution of the TIOA framework -- Related work -- Organization of the book --
2. Mathematical preliminaries -- Functions and relations -- Sequences -- Partial orders -- A basic graph Lemma --
3. Describing timed system behavior -- Time -- Static and dynamic types -- Trajectories -- Basic definitions -- Prefix ordering -- Concatenation -- Hybrid sequences -- Basic definitions -- Prefix ordering -- Concatenation -- Restriction --
4. Timed automata -- Definition of timed automata -- Executions and traces -- Invariants -- Special kinds of timed automata -- Implementation relationships -- Simulation relations -- Forward simulations -- Refinements -- Backward simulations -- History relations -- Prophecy relations --
5. Operations on timed automata -- Composition -- Definitions and basic results -- Substitutivity results -- Hiding -- Extending timed automata with bounds --
6. Properties for timed automata -- Properties for hybrid sequences -- Properties for timed automata -- Implementation -- Operations --
7. Timed I/O automata -- Definition of timed I/O automata -- Executions and traces -- Special kinds of timed I/O automata -- Feasible and I/O feasible TIOAs -- Progressive TIOAs -- Receptive timed I/O automata -- Implementation relationships -- Simulation relations --
8. Operations on timed I/O automata -- Composition -- Definitions and basic results -- Substitutivity results -- Composition of special kinds of TIOAs -- Hiding --
9. Conclusions and future work -- Bibliography -- Authors' biographies -- Index.
Abstract freely available; full-text restricted to subscribers or individual document purchasers.
Compendex
INSPEC
Google scholar
Google book search
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.
Also available in print.
Title from PDF t.p. (viewed on December 10, 2010).
There are no comments for this item.