Abstract:
Timed automata has been developed as a basic semantic model for real time systems. Its algorithmic aspects for automated analysis have been well studied. But so far there is still no satisfactory algebraic theory to allow the derivation of semantical equivalence of automata by purely syntactical manipulation. The aim of this paper is to provide such a theory. We present an inference system of timed bisimulation equivalence for timed automata based on a CCS-style regular 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. The inference system is shown to be sound and complete for timed bisimulation. The proof of the completeness result relies on the notion of symbolic timed bisimulation, adapted from the work on value{passing processes. 1
Citations
|
1393
|
A theory of timed automata
– Alur, Dill
- 1994
|
|
144
|
Symbolic bisimulations
– Hennessy, Lin
- 1995
|
|
101
|
A Complete Inference System for a Class of Regular Behaviours
– Milner
- 1984
|
|
58
|
A Kleene Theorem for Timed Automata
– Asarin, Caspi, et al.
- 1997
|
|
52
|
Two complete axiom systems for the algebra of regular events
– Salomaa
- 1966
|
|
32
|
A Calculus of Real Time Systems
– Yi
- 1991
|
|
31
|
An algebraic framework for urgency
– Bornot, Sifakis
- 2000
|
|
28
|
Proof systems for message-passing process algebras
– Hennessy, Lin
- 1996
|
|
16
|
Decomposition and Composition of Timed Automata
– Bouyer, Petit
- 1999
|
|
12
|
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
– Aceto, Jeffrey
- 1995
|
|
9
|
A Calculus for Timed Automata (Extended Abstract
– D'Argenio, Brinksma
- 1996
|
|
7
|
Automatic veri of real-time communicating systems by constraint-solving
– Yi, Pettersson, et al.
- 1994
|
|
3
|
Cerans. Decidability of Bisimulation Equivalences for Parallel Timer Processes
– unknown authors
- 1992
|
|
2
|
Symbolic Bisimulation for Timed Processes
– Boreale
- 1996
|
|
2
|
A proof system for timed automata
– Lin, Wang
- 2000
|
|
1
|
Unique Fixpoint Induction for the -Calculus
– Lin
- 1995
|
