Randomization helps in ltl model checking

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

Volumn 2165, Issue , 2001, Pages 105-119

  Brim, Luboš ^a   Černá, Ivana ^a   Nečesal, Martin ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DISTRIBUTED COMPUTER SYSTEMS; RANDOM PROCESSES;

COMPUTATION TIME; LTL MODEL-CHECKING; MEMORY REQUIREMENTS; MODEL CHECKER; NON-PROBABILISTIC; SPIN MODELS;

MODEL CHECKING;

EID: 84957810389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44804-7_7     Document Type: Conference Paper

References (14)

1. C. Baier andM. Kwiatkowska. Model Checking for a Probabilistic Branching Time Logic with Fairness. DISTCOMP: Distributed Computing, 11, 1998.
2. A. Bianco and L. De Alfaro. Model Checking of Probabilistic and Nondeterministic Systems. In P. S. Thiagarajan, editor, Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 1026 of LNCS, pages 499–513. Springer-Verlag, 1995.
3. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, 1:275–288, 1992.
4. C. Courcoubetis andM. Yannakakis. The Complexity of Probabilistic Verification. Journal of the ACM, 42(4):857–907, July 1995.
5. P. Godefroid, G. J. Holzmann, and D. Pirottin. State-Space Caching Revisited. Formal Methods in System Design: An International Journal, 7(3):227–241, November 1995.
6. G. J. Holzmann. An Analysis of Bitstate Hashing. Formal Methods in System Design: An International Journal, 13(3):289–307, Nov. 1998.
7. G.J. Holzmann, D. Peled, and M. Yannakakis. On NestedDepth First Search. In The SPIN Verification System, pages 23–32. American Mathematical Society, 1996. Proc. of the SecondSPIN Workshop.
8. M. Narasimha, R. Cleaveland, and P. Iyer. Probabilistic Temporal Logics via the Modal Mu-Calculus. In W. Thomas, editor, Proceedings of the Second International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), volume 1578 of LNCS, pages 288–305. Springer-Verlag, 1999.
9. U. Stern and D.L. Dill. Combining State Space Caching andHash Compaction. In B. Straube andJ. Schoenherr, editors, 4. GI/ITG/GME Workshop zur Methoden des Entwurfs und der Verifikation Digitaler Systeme, pages 81–90. Shaker Verlag, Aachen, 1996.
10. R. Tarjan. Depth First Search andLinear Graph Algorithms. SIAM journal on computing, pages 146–160, Januar 1972.
11. M. Vardi. Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach. In J.-P. Katoen, editor, International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems (ARTS), volume 1601 of LNCS, pages 265–276. Springer-Verlag, 1999.
12. W. Visser. Using OBDD Encodings for Space Efficient State Storage during Onthe- fly Model Checking. Proceedings of the 1st SPINWorkshop, Montreal, Canada, 1995.
13. A. K. Wisspeintner, F. Huber, and J. Philipps. Model Checking andRand om Competition – A Study Using the Model Checking Framework MIC. 10. GI/ITG Fachgesprach ”Formale Beschreibungstechniken fur verteilte Systeme”, pages 91–100, June 2000.
14. P. Wolper and D. Leroy. Reliable Hashing Without Collision Detection. In C. Courcoubetis, editor, Proc. 5th International Computer Aided Verification Conference (CAV’93), volume 697 of LNCS, pages 59–70. Springer-Verlag, 1993.