121 search results - page 11 / 25 » The complexity of temporal logic over the reals |
107
click to vote
BIRTHDAY
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This article provides an overview over two constructive approaches to provably correct hard real-time code generation where hard real-time code is generated from abstract...
99
Voted
SIGSOFT
2007
ACM
16 years 12 days ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
110
click to vote
ENTCS
2007
14 years 11 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
ENTCS
2007
14 years 11 months ago
2007
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...