Sciweavers

360 search results - page 5 / 72
» Hybrid Branching-Time Logics
Sort
View
KBSE
2005
IEEE
15 years 3 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
ENTCS
2007
109views more  ENTCS 2007»
14 years 9 months ago
Symbolic Model Checking for Channel-based Component Connectors
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
Sascha Klüppelholz, Christel Baier
ECAI
2010
Springer
14 years 11 months ago
Parallel Model Checking for Temporal Epistemic Logic
Abstract. We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time tem...
Marta Z. Kwiatkowska, Alessio Lomuscio, Hongyang Q...
FSTTCS
2006
Springer
15 years 1 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...