662 search results - page 38 / 133 » Model Checking Procedures for Infinite State Systems |
140
Voted
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
130
click to vote
ESORICS
2002
Springer
16 years 2 months ago
2002
Springer
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...
101
click to vote
ANOR
2002
15 years 2 months ago
2002
A subgame perfection refinement of Nash equilibrium is suggested for games of the following type: each of an infinite number of identical players selects an action using his privat...
130
Voted
QEST
2007
IEEE
15 years 8 months ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
121
click to vote
ENTCS
2007
15 years 2 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...