85 search results - page 16 / 17 » Partial-Order Reduction in Symbolic State Space Exploration |
ATAL
2008
Springer
15 years 5 days ago
2008
Springer
We explore the problem of specification and verification of compliance in agent based Web service compositions. We use the formalism of temporal-epistemic logic suitably extended ...
100
Voted
AAAI
2010
14 years 11 months ago
2010
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...
128
click to vote
WIA
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
ICFEM
2009
Springer
15 years 2 months ago
2009
Springer
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...