@inproceedings{abc86b4588f24018bdb25da8a12a5ddc,
title = "A proof system for timed automata",
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.",
author = "Huimin Lin and Wang Yi",
year = "2000",
doi = "10.1007/3-540-46432-8\_14",
language = "英语",
isbn = "3540672575",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "208--222",
editor = "Jerzy Tiuryn",
booktitle = "Foundations of Software Science and Computation Structures - Third International Conference, FOSSACS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000",
address = "德国",
note = "3rd International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 ; Conference date: 25-03-2000 Through 02-04-2000",
}