1018 search results - page 135 / 204 » Abstraction and Refinement in Model Checking |
IPL
2008
13 years 7 months ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
ICWS
2009
IEEE
13 years 5 months ago
2009
IEEE
Workflow models have been used and refined for years to execute processes within organisations. To deal with collaborative processes (choreographies) these internal workflow model...
DAGSTUHL
2007
13 years 9 months ago
2007
iary models in order to bridge the semantic gap between high-level, abstract user requirements and low-level, concrete programs and to support a stepwise refinement process. This d...
TACAS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...