Difference Decision Diagrams

Møller, Jesper B.; Lichtenberg, Jakob; Andersen, Henrik Reif; Hulgaard, Henrik

doi:10.1007/3-540-48168-0_9

Cited by 77 publications

(65 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea is to mathematically model SpecC programs by equalities/inequalities formulae. Difference Decision Diagrams (DDDs) [25] are used as the verification engine, but unfortunately these cannot handle the large state space found in realistic designs. …”

Section: Related Workmentioning

confidence: 99%

Synchronization Verification in System-Level Design with ILP Solvers

Sakunkonchak

Komatsu

Fujita

2006

IEICE Transactions on Fundamentals of Electronics, Communicatio

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Synchronization Verification in System-Level Design with ILP Solvers

Sakunkonchak

Komatsu

Fujita

2006

IEICE Transactions on Fundamentals of Electronics, Communicatio

View full text Add to dashboard Cite

show abstract

“…In the last several years, people have explored this approach in the hope of duplicating the success of BDD techniques [10], [12] in hardware verification for the verification of timed automata [2], [9], [11], [18], [21], [22], [23], [24], [25]. Our HRD can be seen as a variation of CDD (Clock-Difference Diagram) [11] and an extension of CRD (Clock-Restriction Diagram) [23], [24] for timed systems.…”

Section: Related Workmentioning

confidence: 99%

Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures

Wang

2005

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and present algorithms for weakest precondition calculations. This permits us to reason about the valuations of parameters that make safety properties satisfied. Advantages of our approach include the ability to represent discrete state information and concave polyhedra in a unified scheme, as well as to save both memory consumptions and manipulation times when processing the same substructures in state-space representations. Our experimental results document its efficiency in practice.

show abstract

“…using lists of zones or structures as CDDs [4], DDDs [21]), the actual computation of the closure would be at least as difficult as solving the locationreachability problem itself [1,2]. What we are looking for is an alternative abstraction obtained by a more efficient analysis of the relevance of guards.…”

Section: Location-dependent Maximal Constantsmentioning

confidence: 99%

Static Guard Analysis in Timed Automata Verification

Behrmann

Bouyer

Fleury

et al. 2003

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. By definition Timed Automata have an infinite state-space, thus for verification purposes, an exact finite abstraction is required. We propose a locationbased finite zone abstraction, which computes an abstraction based on the relevant guards for a particular state of the model (as opposed to all guards). We show that the location-based zone abstraction is sound and complete with respect to location reachability; that it generalises active-clock reduction, in the sense that an inactive clock has no relevant guards at all; that it enlarges the class of timed automata, that can be verified. We generalise the new abstraction to the case of networks of timed automata, and experimentally demonstrate a potentially exponential speedup compared to the usual abstraction.

show abstract

Difference Decision Diagrams

Abstract: This paper describes a new data structure, difference decision diagrams (DDDs)

Cited by 77 publications

References 24 publications

Synchronization Verification in System-Level Design with ILP Solvers

Synchronization Verification in System-Level Design with ILP Solvers

Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures

Static Guard Analysis in Timed Automata Verification

Contact Info

Product

Resources

About