A Proof System for Timed Automata

Authors:
Huimin Lin;Wang Yi
Affiliations:
-;-
Venue:
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Year:
2000

Citing 7
Cited 2

A theory of timed automata

Theoretical Computer Science
Symbolic bisimulations

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Communication and Concurrency

Communication and Concurrency
Automatic verification of real-time communicating systems by constraint-solving

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
A Calculus for Timed Automata

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Decidability of Bisimulation Equivalences for Parallel Timer Processes

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Symbolic Bisimulation for Timed Processes

AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology

A Complete Axiomatisation for Timed Automata

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Verification of computation orchestration via timed automata

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form Φ ▹ t = u where Φ is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete for timed bisimulation over the recursion-free subset of the language. The completeness proof relies on the notion of symbolic timed bisimulation. The axiomatisation is also extended to handle an important variation of timed automata where each node is associated with an invariant constraint.