305 search results - page 55 / 61 » Petri Net Analysis Using Decision Diagrams |
157
click to vote
FM
2001
Springer
15 years 10 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
152
click to vote
SEFM
2008
IEEE
16 years 8 days ago
2008
IEEE
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
197
click to vote
STRINGOLOGY
2004
15 years 7 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
228
click to vote
CHARME
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
151
click to vote
DAC
2010
ACM
15 years 9 months ago
2010
ACM
State-of-the-art automatic reliability analyses as used in system-level design approaches mainly rely on Binary Decision Diagrams (BDDs) and, thus, face two serious problems: (1) ...