1472 search results - page 91 / 295 » On Model Checking Infinite-State Systems |
148
Voted
CAV
2000
Springer
15 years 7 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
141
click to vote
ICFEM
2009
Springer
15 years 10 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
144
click to vote
DSN
2002
IEEE
15 years 8 months ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
115
click to vote
ICFEM
2007
Springer
15 years 10 months ago
2007
Springer
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
157
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...