Sciweavers

93 search results - page 8 / 19
» Partial Order Reduction for Model Checking of Timed Automata
Sort
View
LMCS
2007
132views more  LMCS 2007»
14 years 9 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
77
Voted
SPIN
2009
Springer
15 years 4 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt
BIOCOMP
2009
14 years 7 months ago
Simulating Spatial Partial Differential Equations with Cellular Automata
Abstract-- Spatial partial differential equations are commonly used to describe systems of biological entities, such as patterns created by desert vegetation and biovermiculation g...
Brian Strader, Keith E. Schubert, Ernesto Gomez, J...
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 ...
ECLIPSE
2006
ACM
15 years 1 months ago
A toolsuite for the verification of real-time systems in Eclipse
In this work we present an Eclipse plug-in for the VInTiMe (Verifier of INtegrated TImed ModEls)1 suite of tools that combines high-level expressive power, unassisted propertypres...
Lucía Cavatorta, Guido de Caso, André...