Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

@inproceedings{Wilke1994SpecifyingTS,
  title={Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata},
  author={Thomas Wilke},
  booktitle={FTRTFT},
  year={1994}
}
A monadic second-order language, denoted by Ld, is introduced for the speciication of sets of timed state sequences. A fragment of Ld, denoted by L $ d, is proved to be expressively complete for timed automata (Alur and Dill), i. e., every timed regular language is deenable by a L $ d-formula and every L $ d-formula deenes a timed regular language. As a consequence the satissability problem for L $ d is decidable. Timed temporal logics are shown to be eeectively embeddable into L $ d and hence… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 101 CITATIONS, ESTIMATED 47% COVERAGE

213 Citations

051015'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 213 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…