Name
Abstract | ||
|---|---|---|
The exploration of the state space of the model is at the heart of model checking. Symbolic algorithms often use Binary Decision Diagrams for the representation of sets of states, and have to pay attention to the size of the BDDs. We review the techniques that have been proposed for this task in the framework of closed sequences of monotonic functions. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S1571-0661(04)80668-6 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
model checking,monotone function,binary decision diagram,state space | Monotonic function,Discrete mathematics,Abstraction model checking,Model checking,Computer science,Binary decision diagram,Theoretical computer science,Symbolic data analysis,State space,Symbolic trajectory evaluation | Journal |
Volume | Issue | ISSN |
23 | 2 | 1571-0661 |
Citations | PageRank | References |
3 | 0.62 | 17 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabio Somenzi | 1 | 3394 | 302.47 |