Safety and liveness from a methodological point of view
Information Processing Letters
Information Processing Letters
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Forward and backward simulations II.: timing-based systems
Information and Computation
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
A note on fairness in I/O automata
Information Processing Letters
Liveness in timed and untimed systems
Information and Computation
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Time-Constrained Automata (Extended Abstract)
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Proceedings of the Real-Time: Theory in Practice, REX Workshop
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Correctness of vehicle control systems-a case study
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
High-Level Modeling and Analysis of TCAS
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
ACTION TRANSDUCERS AND TIMED AUTOMATA
ACTION TRANSDUCERS AND TIMED AUTOMATA
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Information and Computation
Modeling and Verifying a Lego Car Using Hybrid I/O Automata
QSIC '03 Proceedings of the Third International Conference on Quality Software
Safety verification of model helicopter controller using hybrid input/output automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Gradient clock synchronization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Specifying Urgency in Timed I/O Automata
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Gradient clock synchronization
Distributed Computing - Special issue: PODC 04
Can We Build an Automatic Program Verifier? Invariant Proofs and Other Challenges
Verified Software: Theories, Tools, Experiments
Towards a real-time distributed computing model
Theoretical Computer Science
Modeling and verification of real-time embedded systems with urgency
Journal of Systems and Software
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
PVS Strategies for Proving Abstraction Properties of Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Undecidability of universality for timed automata with minimal resources
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Model-based specification of timing requirements
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Methodologies for specification of real-time systems using timed I/O automata
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Translating timed i/o automata specifications for theorem proving in PVS
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Model checking the time to reach agreement
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Interoperability of constrained finite state automata
ACM SIGSOFT Software Engineering Notes
Clock synchronization for wireless networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Model checking timed systems with urgencies
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Pre-orders for reasoning about stability
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
New results on timed specifications
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Revisiting timed specification theories: a linear-time perspective
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Timed-rebeca schedulability and deadlock-freedom analysis using floating-time transition system
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
ACM Computing Surveys (CSUR)
Pre-orders for reasoning about stability properties with respect to input of hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
We describe the Timed Input/Output Automata (TIOA)framework, a general mathematical framework for modelingand analyzing real-time systems. It is based on timedI/O automata, which engage in both discrete transitions andcontinuous trajectories. The framework includes a notionof external behavior, and notions of composition and abstraction.We define safety and liveness properties for timedI/O automata, and a notion of receptiveness, and prove basicresults about all of these notions. The TIOA frameworkis defined as a special case of the new Hybrid I/O Automata(HIOA) modeling framework for hybrid systems. Specifically,a TIOA is an HIOA with no external variables; thus,TIOAs communicate via shared discrete actions only, anddo not interact continuously. This restriction is consistentwith previous real-time system models, and gives rise tosome simplifications in the theory (compared to HIOA). Theresulting model is expressive enough to describe complextiming behavior, and to express the important ideas of previoustimed automata frameworks.