Sciweavers

5 search results - page 1 / 1
» Linear Temporal Logic and Z Refinement
Sort
View
AMAST
2004
Springer
13 years 8 months ago
Linear Temporal Logic and Z Refinement
Since Z, being a state-based language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also...
John Derrick, Graeme Smith
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
12 years 12 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
13 years 10 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
CADE
2002
Springer
14 years 5 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
LICS
2003
IEEE
13 years 10 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