Sciweavers

254 search results - page 32 / 51
» Model Checking Branching Time Logics
Sort
View
138
Voted
LOGCOM
2007
91views more  LOGCOM 2007»
15 years 3 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
127
Voted
STACS
2001
Springer
15 years 7 months ago
On Presburger Liveness of Discrete Timed Automata
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmere...
132
Voted
CONCUR
2009
Springer
15 years 7 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
TACAS
2001
Springer
135views Algorithms» more  TACAS 2001»
15 years 7 months ago
Implementing a Multi-valued Symbolic Model Checker
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
Marsha Chechik, Benet Devereux, Steve M. Easterbro...
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 3 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...