Name
Abstract | ||
|---|---|---|
When extending CTL with constructs for quantitative reasoning on time, either the linear algorithm complexity of standard model checking gets lost, efficient ROBDD techniques are no more applicable or the semantics becomes counter intuitive. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0014710 | HART |
Keywords | Field | DocType |
discrete timed symbolic model,new algorithm,standard model,discrete time | Abstraction model checking,Discrete mathematics,Model checking,Computer science,Linear algorithm,Theoretical computer science,CTL*,Semantics,Qualitative reasoning,Symbolic trajectory evaluation | Conference |
Volume | ISSN | ISBN |
1201 | 0302-9743 | 3-540-62600-X |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Ruf | 1 | 122 | 23.04 |
| Thomas Kropf | 2 | 326 | 59.09 |