Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams1 1This work was carried out while the authors were at the Department of Information Technology, Technical University of Denmark, and was finnancially supported by a grant from the Danish Technical Research Council.-Reference-Cited by-同舟云学术

Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams1 1This work was carried out while the authors were at the Department of Information Technology, Technical University of Denmark, and was finnancially supported by a grant from the Danish Technical Research Council.

Published:2001-12 Issue:2 Volume:23 Page:88-107
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Møller Jesper,Lichtenberg Jakob,Andersen Henrik R.,Hulgaard Henrik

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference34 articles.

1. An old-fashioned recipe for real-time;Abadi,1991

2. The theory of timed automata;Alur,1991

3. Data-structures for the verification of timed automata;Asarin,1997

4. Approximate reachability analysis of timed automata;Balarin,1996

5. G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and Wang Yi. Efficient timed reachability analysis using clock difference diagrams. Technical Report DoCS Technical Report 99/105, Uppsala University, 1999.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reachability in timed automata;ACM SIGLOG News;2022-07

2. Trace Abstraction Refinement for Timed Automata;Automated Technology for Verification and Analysis;2014

3. Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements;Lecture Notes in Computer Science;2002

4. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions;Automated Deduction—CADE-18;2002

5. Bounded Model Checking for Timed Systems;Formal Techniques for Networked and Distributed Sytems — FORTE 2002;2002