A graph-theoretic approach for timing analysis and its implementation
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Timed acceptances: an algebra of time-dependent computing
Timed acceptances: an algebra of time-dependent computing
Reasoning About Time in Higher-Level Language Software
IEEE Transactions on Software Engineering
The Spring kernel: a new paradigm for real-time operating systems
ACM SIGOPS Operating Systems Review
Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Using mappings to prove timing properties
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Temporal proof methodologies for real-time systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal methods for the specification and design of real-time safety critical systems
Journal of Systems and Software
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Assertional Verification of a Timer Based Protocol
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Time-Constrained Automata (Extended Abstract)
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
An Old-Fashioned Recipe for Real Time
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Forward and Backward Simulations for Timing-Based Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Proving real-time properties of programs with temporal logic
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Real-time programming and asynchronous message passing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Designing algorithms for distributed systems with partially synchronized clocks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Efficient asynchronous distributed symmetry breaking
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Liveness conditions in model-based service specifications: a case study
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Formal verification of timed properties of randomized distributed algorithms
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Simulation-Verification: Biting at the State Explosion Problem
IEEE Transactions on Software Engineering
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
Theoretical Computer Science
A Practical Hierarchical Design by Timed Simulation Relations for Real-Time Systems
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A guided method for testing timed input output automata
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
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
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
| Hi-index | 0.00 |
A new technique for proving timing properties for timing-based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multi-valued mapping from the "assumptions automaton" to the "requirements automaton" is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of "progress functions" providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a two-process race system.