Stepwise CTL model checking of state/event systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1633, Issue , 1999, Pages 316-327

  Lind Nielsen, Jørn ^a   Andersen, Henrik Reif ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; EMBEDDED SYSTEMS;

COMPOSITIONALITY; CTL MODEL-CHECKING; MEALY MACHINES; REACTIVE SYSTEM; SYMBOLIC MODEL CHECKING; UPPER AND LOWER BOUNDS;

MODEL CHECKING;

EID: 84957106726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_28     Document Type: Conference Paper

References (16)

1. F. Balarin and A.L. Sangiovanni-Vincentelli. An iterative approach to language containment. In C. Courcoubetis, editor, CAV'93. 5th International Conference on Computer Aided Verification, volume 697 of LNCS, pages 29-40, Berlin, 1993. Springer-Verlag.
2. Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
3. Randal E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
4. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proc. 1991 Int. Conf. on VLSI, August 1991.
5. William Chan, Richard J. Anderson, Paul Beame, and David Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA-98), volume 23,2 of ACM Software Engineering Notes, pages 102-112, New York, March2-5 1998. ACM Press.
6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
7. J.R. Burch, E.M. Clarke, D.E. Long, K.L. MacMillan, and D.L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13(4):401-424, April 1994.
8. J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill. Sequential Circuit Verification Using Symbolic Model Checking. In Proceedings of the 27th ACM/IEEE Design Automation Conference, pages 46-51, Los Alamitos, CA, June 1990. ACM/IEEE, IEEE Society Press.
9. W. Lee, A. Pardo, J.-Y. Jang, G. Hachtel, and F. Somenzi. Tearing based automatic abstraction for CTL model checking. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pages 76-81, Washington, November10-14 1996. IEEE Computer Society Press.
10. Jørn Lind-Nielsen. BuDDy-A Binary Decision Diagram Package. Technical University of Denmark, 1997. http://britta.it.dtu.dk/~jl/buddy.
11. Jørn Lind-Nielsen, Henrik Reif Andersen, Gerd Behrmann, Henrik Hulgaard, Kare Kristoffersen, and Kim G. Larsen. Verification of Large State/Event Systems using Compositionality and Dependency Analysis. In TACAS'98 Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, 1998.
12. David E. Long. Model Checking, Abstraction and Compositional Verification. PhD thesis, Carnegie Mellon, 1993.
13. 11E 3.0 User's Guide, 1996.
14. Abelardo Pardo and Gary D. Hachtel. Automatic abstraction techniques for pro-positional μ-calculus model checking. In Computer Aided Verification, CAV'97. Springer Verlag, 1997.
15. Fabio Somenzi. CUDD: CU Decision Diagram Package. University of Colorado at Boulder, 1997.
16. A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific J.Math, 5:285-309, 1955.