Sciweavers

62 search results - page 6 / 13
» Boolean Abstraction for Temporal Logic Satisfiability
Sort
View
SIGSOFT
2007
ACM
15 years 10 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
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...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
CORR
2007
Springer
135views Education» more  CORR 2007»
14 years 9 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell
86
Voted
FAC
2008
114views more  FAC 2008»
14 years 9 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
FORMATS
2007
Springer
15 years 3 months ago
AMT: A Property-Based Monitoring Tool for Analog Systems
Abstract. In this paper we describe AMT, a tool for monitoring temporal properties of continuous signals. We first introduce STL/PSL, a specification formalism based on the indus...
Dejan Nickovic, Oded Maler
TOCL
2008
128views more  TOCL 2008»
14 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...