558 search results - page 16 / 112 » Optimizing Symbolic Model Checking for Constraint-Rich Model... |
126
click to vote
SPIN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
127
Voted
CAV
2003
Springer
15 years 8 months ago
2003
Springer
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model...
114
click to vote
FORMATS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
168
click to vote
SPIN
2001
Springer
15 years 7 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
137
click to vote
ICTAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...