Accepting predecessors are better than back edges in distributed LTL model-checking

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

Volumn 3312, Issue , 2004, Pages 352-366

  Brim, Luboš ^a   Černá, Ivana ^a   Moravcc, Pavcl ^a   Šimša, Jiří ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; COMPUTER AIDED DESIGN; DISTRIBUTED COMPUTER SYSTEMS; FORMAL METHODS; OPTIMIZATION;

ALGORITHM PERFORMANCE; CLUSTER OF WORKSTATIONS; DISTRIBUTED MEMORY ALGORITHMS; LTL MODEL-CHECKING; SUBGRAPHS;

MODEL CHECKING;

EID: 32044445465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_25     Document Type: Article

References (16)

1. J. Barnat, L. Brim, and J. Chaloupka. Parallel Breadth-First Search LTL ModelChecking. In 18th IEEE International Conference on Automated Software Engineering (ASE'03), pages 106-115. IEEE Computer Society, Oct. 2003.
2. J. Barnat, L. Brim, and J. Střibrná. Distributed LTL Model-Checking in SPIN. In Matthew B. Dwyer, editor, Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'01), volume 2057 of LNCS, pages 200-216. Springer, 2001.
3. J. Barnat, L. Brim, and I. Černá. Property Driven Distribution of Nested DFS. In Proceedinfs of the 3rd International Workshop on Verification and Computational Logic (VCL'02 - held at the PLI 2002 Symposium), pages 1-10. University of Southampton, UK, Technical Report DSSE-TR-2002-5 in DSSE, 2002.
4. S. Blom and S. Orzan. Distributed branching bisimulation reduction of state spaces. In L. Brim and O. Grumberg, editors, Electronic Notes in Theoretical Computer Science, volume 89.1. Elsevier, 2003.
5. B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN'02), volume 2318 of LNCS, pages 128147. Springer, 2002.
6. L. Brim, I. Cerna, P. Krcdl, and R. Pelánek. Distributed LTL model checking based on negative cycle detection. In Ramesh Hariharan, Madhavan Mukund, and V. Vinay, editors, Proceedings of Foundations of Software Technology and Theoretical Computer Science (FST-TCS'Ol), volume 2245 of LNCS, pages 96-107. Springer, 2001.
7. I. Cerna and R. Pelánek. Distributed explicit fair cycle detection. In Thomas Ball and Sriram K. Rajamani, editors, Model Checking Software, 10th International SPIN Workshop, volume 2648 of LNCS, pages 49-73. Springer, 2003.
8. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, Cambridge, Massachusetts, 1999.
9. 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.
10. H. Garavel, R. Mateescu, and I.M Smarandache. Parallel State Space Construction for Model-Checking. In Matthew B. Dwyer, editor, Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'01), volume 2057 of LNCS, pages 200-216. Springer, 2001.
11. B. R. Haverkort, A. Bell, and H. C. Bohnenkamp. On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets. In Proceedings of the 8th International Workshop on Petri Nets and Performance Models (PNPM'99), pages 12-21. IEEE Computer Society Press, 1999.
12. T. Heyman, O. Grumberg, and A. Schuster. A work-efficient distributed algorithm for reachability analysis. In Warren A. Hunt Jr. and Fabio Somenzi, editors, 15th International Conference (CAV'03), volume 2725 of LNCS, pages 54-66. Springer, 2003.
13. R. Hojati, H. Touati, R. P. Kurshan, and R. K. Brayton. Efficient omega-regular language containment. In G. von Bochmann and D. K. Probst, editors, Proc. of the Fourth International Workshop CAV'92, pages 396-409. Springer, 1993.
14. F. Lerda and R. Sisto. Distributed-memory model checking with SPIN. In Proceedings of the 6th International SPIN Workshop on Model Checking of Software (SPIN'99), volume 1680 of LNCS, pages 22-39, Berlin, 1999. Springer.
15. R. Palmer and Ganesh Gopalakrishnan. A distributed partial order reduction algorithm. In D. Peled and M. Y. Vardi, editors, Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings, volume 2529 of LNCS, page 370. Springer, 2002.
16. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science (LICS'86), pages 332-344. Computer Society Press, 1986.