Lubos Brim, Ivana Cerna, Pavel Krcal, Radek Pelanek  Home/Search
Context Related
| fi.muni.cz/usr/brim/pu...fsttcs01.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: This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All the known methods for automata based model checking are based on depth first traversal of the state space which is difficult to parallelise as the ordering in which vertices are visited plays an important role. We come up with entirely different approach which is dependent on locating cycles with negative length in a directed... (Update)
Cited by: More
UppDMC: A Distributed Model Checker for Fragments of.. - Holmen, Leucker.. (2004) (Correct)
Parallel Model Checking for LTL, CTL*, and L ²μ - Leucker, Somla, Weber (2003) (Correct)
LTL Model Checking - Pelánek (2003) (Correct)
Similar documents (at the sentence level):
15.4%: Unknown - Ya--- Fi Mu (2001) (Correct)
12.0%: Distributed Shortest Paths for Directed Graphs with.. - Brim, Cerná, Krcál.. (2001) (Correct)
7.2%: How to Employ Reverse Search in Distributed Single.. - Brim, Cerna, Krcal.. (2001) (Correct)
Active bibliography (related documents): More All
3.5: Distributed LTL Model Checking Based on Negative Cycle.. - Brim, Cerna, Krcal.. (2001) (Correct)
0.7: Distributed Explicit Fair Cycle Detection - Cerna, Pelane (2003) (Correct)
0.5: Property Driven Distribution of Nested DFS - Barnat, Brim, Cerna (2002) (Correct)
Similar documents based on text: More All
1.0: Fast LTL to Büchi Automata Translation - Gastin, Oddoux (Correct)
0.9: Distributed LTL Model-Checking in SPIN - Barnat, Brim.. (2001) (Correct)
0.8: Relating Hierarchy of Linear Temporal Properties to Model.. - Cerna, Pelanek (2003) (Correct)
Related documents from co-citation: More All
12: Distributed-memory model checking with spin - Lerda, Sisto - 1999
11: Model Checking - Clarke, Grumberg et al. - 1994
11: Distributed LTL model-checking in SPIN - Barnat, Brim et al. - 2000
BibTeX entry: (Update)
L. Brim, I. Cerna, P. Krcal, and R. Pelanek. Distributed LTL model-checking based on negative cycle detection. In Proc. of 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), LNCS. Springer, Dec. 2001. This is also the reason why we did not optimise our algorithm wrt. an a-priori-known transition systems. http://citeseer.ist.psu.edu/article/brim01distributed.html More
@article{ brim01distributed,
author = "Lubo{\v{s}} Brim and Ivana {\v{C}}ern{\'a} and Pavel Kr{\v{c}}{\'a}l and Radek Pel{\'a}nek",
title = "Distributed {LTL} Model Checking Based on Negative Cycle Detection",
journal = "Lecture Notes in Computer Science",
volume = "2245",
pages = "96--107",
year = "2001",
url = "citeseer.ist.psu.edu/article/brim01distributed.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
434 An automata-theoretic approach to automatic program vericati.. (context) - Vardi, Wolper
375 IEEE Transactions on Software Engineering (context) - Holzmann, checker - 1997
58 Depth rst search and linear graph algorithms (context) - Tarjan - 1972
27 Distributed-memory model checking with SPIN - Lerda, Sisto
24 Negative-cycle detection algorithms - Cherkassky, Goldberg - 1999
23 Distributed LTL Model-Checking in SPIN - Barnat, Brim et al.
21 Shortest path queries in digraphs of small treewidth (context) - Chaudhuri, Zaroliagis
18 Achieving scalability in parallel reachability analysis of v.. - Heyman, Geist et al.
17 A simple parallel algorithm for the single-source shortest p.. (context) - Tra, Zaroliagis
15 Distributed reachability analysis for protocol verication en.. (context) - Aggarwal, Alonso et al. - 1987
14 Parallelizing the Mur' verier (context) - Stern, Dill
14 A parallelization of Dijkstra's shortest path algorithm - Crauser, Mehlhorn et al. - 1998
12 Parallel shortest path for arbitrary graphs - Meyer, Sanders
11 On nested depth rst search (context) - Holzmann, Peled et al. - 1996
9 Parallel processing and parallel algorithms (context) - Roosta - 2000
7 symbolic model checking (context) - Ben-David, Heyman et al.
6 Distributed shortest path for directed graphs with negative .. - Brim, Cern et al.
6 Progress on the state explosion problem in model checking - Clarke, Grumberg et al.
5 Ecient parallel shortest-paths in digraphs with a separator .. (context) - Cohen - 1996
5 On nding and updating shortest paths distributively (context) - Ramarao, Venkatesan - 1992
4 Depth-rst search is inherrently sequential (context) - Reif - 1985
4 Parallel model checking for the alternation free mu-calculus (context) - Bollig, Leucker et al.
3 Ecient sequential and parallel algorithms for the negative c.. (context) - Spirakis, Kavvadias et al.
2 Distributed timed model checking | how the search order matt.. (context) - Behrmann, Hune et al.
2 Distributed model checking for mucalculus (context) - Grumberg, Heyman et al. - 2001
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
Multi-Agent Systems as Concurrent Constraint Processes - Brim, Gilbert, Jacquet.. (2001) (Correct)
Randomization Helps in LTL Model Checking - Brim, Cerna, Necesal (2001) (Correct)
Distributed LTL Model-Checking in SPIN - Barnat, Brim.. (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