444 search results - page 27 / 89 » Sensitive state-space exploration |
KBSE
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
CAISE
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we present a heuristic approach for finding errors and possible improvements in business process models. First, we translate the information that is included in a m...
108
click to vote
SARA
2009
Springer
15 years 6 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
114
click to vote
QEST
2007
IEEE
15 years 6 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...