Temporal Logic + Timed Automata: Expressiveness and Decidability (1995) [12 citations — 8 self]
Download:
|
|
by Ahmed Bouajjani, Yassine Lakhnech
CONCUR95, LNCS 962
http://www.informatik.uni-kiel.de/~yl/concur95.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Bouajjani95temporallogic,author = {Ahmed Bouajjani and Yassine Lakhnech},
title = {Temporal Logic + Timed Automata: Expressiveness and Decidability},
booktitle = {CONCUR95, LNCS 962},
year = {1995},
pages = {531--546},
publisher = {Springer--Verlag}
}
Years of Citing Articles
Abstract:
We investigate the verification problem of timed automata w.r.t. linear-time dense time temporal logics. We propose a real-time logic TATL which extends the propositional temporal logic with constraints involving timed automata. These constraints allow to require that the computation segment since some designated point is accepted by a given timed automaton. We identify an expressively powerful fragment of this logic, called TATL for which the verification problem is decidable. To establish this result, we define a fragment of TATL, called TATL \Theta
