Sciweavers

254 search results - page 13 / 51
» Model Checking Branching Time Logics
Sort
View
FSTTCS
2006
Springer
15 years 3 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 ...
AIIA
2007
Springer
15 years 5 months ago
Curricula Modeling and Checking
In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical language, groun...
Matteo Baldoni, Cristina Baroglio, Elisa Marengo
CONCUR
1999
Springer
15 years 4 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
LICS
2003
IEEE
15 years 5 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
CONCUR
2006
Springer
15 years 1 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink