472 search results - page 58 / 95 » Functional simulation using binary decision diagrams |
WSC
1998
13 years 10 months ago
1998
The design of a quality timetable for the Dutch Railways is a complex task, because of the characteristics of the railway services. The complexity of the network and the heavily i...
VLSID
1996
IEEE
14 years 1 months ago
1996
IEEE
Reduced Ordered Binary Decision Diagrams ROBDDs have traditionally been built in a bottom-up fashion. In this scheme, the intermediate peak memory utilization is often larger than...
ICCD
2005
IEEE
14 years 6 months ago
2005
IEEE
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
WIA
2004
Springer
14 years 2 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 ...
APN
2008
Springer
13 years 11 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...