J. Barnat, L. Brim, J. Stríbrná  Home/Search
Context Related
Links: ACM DBLP | fi.muni.cz/usr/brim/publ...spin01.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fi.muni.cz/usr/brim/online (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in distributed SPIN. A distributed version of the algorithm is presented, and its complexity is discussed. (Update)
Cited by: More
Parallel External Directed Model Checking with Linear I/O - Jabbar, Edelkamp (2006) (Correct)
Directed Search for the Verification of Communication Protocols - Lafuente (2003) (Correct)
LTL Model Checking - Pelánek (2003) (Correct)
Similar documents (at the sentence level):
24.3%: Distributed LTL Model-Checking in SPIN - Barnat, Brim.. (2000) (Correct)
Active bibliography (related documents): More All
0.4: Distributed LTL Model Checking Based on Negative Cycle.. - Brim, Cerna, Krcal.. (2001) (Correct)
0.3: Distributed Explicit Fair Cycle Detection - Cerna, Pelane (2003) (Correct)
0.2: Distributed Explicit Fair Cycle Detection: Set Based Approach - Cerna, Pelnek (Correct)
Similar documents based on text: More All
0.8: Property Driven Distribution of Nested DFS - Barnat, Brim, Cerna (2002) (Correct)
0.5: Parallel Breadth-First Search LTL Model-Checking - Jir Barnat Lubos (2003) (Correct)
0.4: Randomization Helps in LTL Model Checking - Brim, Cerna, Necesal (2001) (Correct)
Related documents from co-citation: More All
23: Distributed-memory model checking with spin - Lerda, Sisto - 1999
12: Model Checking - Clarke, Grumberg et al. - 1994
11: Achieving scalability in parallel reachability analysis of very large circuits - Heyman, Geist et al. - 2000
BibTeX entry: (Update)
J. Barnat, L. Brim, and J. Stribrna. Distributed LTL model-checking in SPIN. Technical Report FIMURS -2000-10, Faculty of Informatics, Masaryk University, 2000. http://citeseer.ist.psu.edu/barnat01distributed.html More
@article{ barnat01distributed,
author = "Jiri Barnat and Lubos Brim and Jitka St{\v{r}}{\'\i}brn{\'a}",
title = "Distributed {LTL} Model-Checking in {SPIN}",
journal = "Lecture Notes in Computer Science",
volume = "2057",
pages = "200+",
year = "2001",
url = "citeseer.ist.psu.edu/barnat01distributed.html" }
Citations (may not include all citations):470 Design and Validation of Computer Protocols (context) - Holzmann - 1991 ACM
85 Special Issue: Formal Methods in Software Practice (context) - Holzmann, checker et al. - 1997
58 Depth rst search and linear graph algorithms (context) - Tarjan - 1972
45 Reliable hashing without collision detection - Wopler, Leroy - 1993
27 Distributed-memory model checking with SPIN - Lerda, Sisto - 1999 ACM DBLP
23 Distributed LTL Model-Checking in SPIN - Barnat, Brim et al. - 2000 ACM DBLP
18 Achieving scalability in parallel reachability analysis of v.. - Heyman, Geist et al. ACM DBLP
15 Distributed reachability analysis for protocol verication en.. (context) - Aggarwal, Alonso et al. - 1987
15 The mur' verication system (context) - Dill - 1996
14 Parallelizing the mur' verier (context) - Stern, Dill - 1997
7 symbolic model checking (context) - Ben-David, Heyman et al. - 2000 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.fi.muni.cz/usr/brim/online.html): More
Distributed LTL Model Checking Based on Negative Cycle.. - Brim, Cerna, Krcal.. (2001) (Correct)
Multi-Agent Systems as Concurrent Constraint Processes - Brim, Gilbert, Jacquet.. (2001) (Correct)
Randomization Helps in LTL Model Checking - Brim, Cerna, Necesal (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC