Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs-Reference-Cited by-同舟云学术

Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs

Published:2001 Issue: Volume: Page:86-91
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Beyer Dirk

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44798-9_6

Reference7 articles.

1. Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.

2. Lect Notes Comput Sci;D. Beyer,2001

3. Lect Notes Comput Sci;M. Bozga,1997

4. Dirk Beyer and Andreas Noack. Efficient verification of timed automata using BDDs. In Proc. Formal Methods for Industrial Critical Systems. to appear, 2001.

5. Dirk Beyer and Heinrich Rust. Modeling a production cell as a distributed real-time system with Cottbus Timed Automata. Proc. FBT’98, pages 148–159. Shaker, 1998.

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

1. Automata-based refinement checking for real-time systems;Computer Science - Research and Development;2014-06-14

2. Verification of Liveness Properties on Closed Timed-Arc Petri Nets;Mathematical and Engineering Methods in Computer Science;2013

3. Modular Verification of Safe Online-Reconfiguration for Proactive Components in Mechatronic UML;Satellite Events at the MoDELS 2005 Conference;2006

4. Can Decision Diagrams Overcome State Space Explosion in Real-Time Verification?;Formal Techniques for Networked and Distributed Systems - FORTE 2003;2003

5. Rabbit: A Tool for BDD-Based Verification of Real-Time Systems;Computer Aided Verification;2003