@inproceedings{d8b06a2b3dcc4a5f9bc2326d3144ca01,
title = "A complete axiomatisation for timed automata",
abstract = "In this paper we present a complete proof system for timed automata. It extends our previous axiomatisation of timed bisimulation for the class of loop-free timed automata with unique fixpoint induction. To our knowledge, this is the first algebraic theory for the whole class of timed automata with a completeness result, thus fills a gap in the theory of timed automata. The proof of the completeness result relies on the notion of symbolic timed bisimulation, adapted from the work on value–passing processes.",
author = "Huimin Lin and Wang Yi",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 20th Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2000 ; Conference date: 13-12-2000 Through 15-12-2000",
year = "2000",
doi = "10.1007/3-540-44450-5\_22",
language = "英语",
isbn = "3540414134",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "277--289",
editor = "Sanjiv Kapoor and Sanjiva Prasad",
booktitle = "FST TCS 2000",
address = "德国",
}