A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Are Timed Automata Bad for a Specification Language? Language Inclusion Checking for Timed Automata
[chapter]
2014
Lecture Notes in Computer Science
Given a timed automaton P modeling an implementation and a timed automaton S as a specification, language inclusion checking is to decide whether the language of P is a subset of that of S. It is known that this problem is undecidable and "this result is an obstacle in using timed automata as a specification language" [2]. This undecidability result, however, does not imply that all timed automata are bad for specification. In this work, we propose a zone-based semi-algorithm for language
doi:10.1007/978-3-642-54862-8_21
fatcat:fp7csehzoffhzcpxk3he5amuni