메뉴 건너뛰기




Volumn 2989, Issue , 2004, Pages 5-22

Typical structural properties of state spaces

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; STRUCTURAL PROPERTIES;

EID: 35048896472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24732-6_2     Document Type: Article
Times cited : (26)

References (32)
  • 1
    • 35048868166 scopus 로고    scopus 로고
    • [://wuw.fi.muni.cz/~xpelanek/state_spaces.
  • 3
    • 85083132922 scopus 로고    scopus 로고
    • Parallel breadth-first search LTL model-checking
    • IEEE Computer Society
    • J. Barnat, L. Brim, and J. Chaloupka. Parallel breadth-first search LTL model-checking. In Proc. Automated Software Engineering (ASE 2003), pages 106-115. IEEE Computer Society, 2003.
    • (2003) Proc. Automated Software Engineering ASE , vol.2003 , pp. 106-115
    • Barnat, J.1    Brim, L.2    Chaloupka, J.3
  • 6
    • 33745787583 scopus 로고    scopus 로고
    • Distributed explicit fair cycle detection
    • I. Černá and R. Pelánek. Distributed explicit fair cycle detection. In Proc. SPIN workshop, volume 2648 of LNCS, pages 49-73, 2003.
    • (2003) Proc. SPIN workshop , vol.2648 , pp. 49-73
    • Černá, I.1    Pelánek, R.2
  • 8
    • 84903134392 scopus 로고    scopus 로고
    • A Sweep-Line Method for State Space Exploration
    • Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001)
    • S. Christensen, L.M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001), volume 2031 of LNCS, pages 450-464, 2001.
    • (2001) LNCS , vol.2031 , pp. 450-464
    • Christensen, S.1    Kristensen, L.M.2    Mailund, T.3
  • 9
    • 35248844099 scopus 로고    scopus 로고
    • Unification & sharing in timed automata verification
    • A. David, G. Behrmann, K. G. Larsen, and W. Yi. Unification & sharing in timed automata verification. In Proc. SPIN Workshop, volume 2648 of LNCS, pages 225-229, 2003.
    • (2003) Proc. SPIN Workshop , vol.2648 , pp. 225-229
    • David, A.1    Behrmann, G.2    Larsen, K.G.3    Yi, W.4
  • 11
    • 0001540595 scopus 로고
    • On random graphs
    • P. Erdos and A. Renyi. On random graphs. Publ. Math., 6:290-297, 1959.
    • (1959) Publ. Math. , vol.6 , pp. 290-297
    • Erdos, P.1    Renyi, A.2
  • 12
    • 84903186573 scopus 로고    scopus 로고
    • Is there a best symbolic cycle-detection algorithm?
    • Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001)
    • K. Fisler, R. Fraer, G. Kamhi Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001), volume 2031 of LNCS, pages 420-434, 2001.
    • (2001) LNCS , vol.2031 , pp. 420-434
    • Fisler, K.1    Fraer, R.2    Kamhi, G.3    Vardi, Y.4    Yang, Z.5
  • 16
    • 0001879305 scopus 로고
    • The syntax and semantics of μCRL
    • Workshops in Computing Series
    • J.F. Groote and A. Ponse. The syntax and semantics of μCRL. In Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26-62, 1995.
    • (1995) Algebra of Communicating Processes '94 , pp. 26-62
    • Groote, J.F.1    Ponse, A.2
  • 17
    • 35248852442 scopus 로고    scopus 로고
    • Large state space visualization
    • Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2003)
    • J.F. Groote and F. van Ham. Large state space visualization. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2003), volume 2619 of LNCS, pages 585-590, 2003.
    • (2003) LNCS , vol.2619 , pp. 585-590
    • Groote, J.F.1    Van Ham, F.2
  • 19
    • 35048889330 scopus 로고    scopus 로고
    • State compression in SPIN: Recursive indexing and compression training runs
    • Twente Univ.
    • G. J. Holzmann. State compression in SPIN: Recursive indexing and compression training runs. In Proc. SPIN Workshop. Twente Univ., 1997.
    • (1997) Proc. SPIN Workshop
    • Holzmann, G.J.1
  • 20
    • 0025207743 scopus 로고
    • Algorithms for automated protocol verification
    • G.J. Holzmann. Algorithms for automated protocol verification. AT&T Technical Journal, 69(2):32-44, 1990.
    • (1990) AT&T Technical Journal , vol.69 , Issue.2 , pp. 32-44
    • Holzmann, G.J.1
  • 21
    • 84948144846 scopus 로고    scopus 로고
    • The engineering of a model checker: The gnu i-protocol case study revisited
    • Proc. SPIN Workshop
    • G.J. Holzmann. The engineering of a model checker: the gnu i-protocol case study revisited. In Proc. SPIN Workshop, volume 1680 of LNCS, pages 232-244, 1999.
    • (1999) LNCS , vol.1680 , pp. 232-244
    • Holzmann, G.J.1
  • 23
    • 16244409154 scopus 로고    scopus 로고
    • Simplified distributed LTL model checking by localizing cycles
    • Institut für Informatik, Universität Freiburg, July
    • A. L. Lafuente. Simplified distributed LTL model checking by localizing cycles. Technical Report 176, Institut für Informatik, Universität Freiburg, July 2002.
    • (2002) Technical Report , vol.176
    • Lafuente, A.L.1
  • 25
    • 84947265856 scopus 로고    scopus 로고
    • A comparative study of symbolic algorithms for the computation of fair cycles
    • Proc. Formal Methods in Computer-Aided Design (FMCAD 2000)
    • K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In Proc. Formal Methods in Computer-Aided Design (FMCAD 2000), volume 1954 of LNCS, pages 143-160, 2000.
    • (2000) LNCS , vol.1954 , pp. 143-160
    • Ravi, K.1    Bloem, R.2    Somenzi, F.3
  • 26
    • 84947288420 scopus 로고    scopus 로고
    • Low-fat recipes for SPIN
    • Theo C. Ruys. Low-fat recipes for SPIN. In Proc. SPIN Workshop, volume 1885 of LNCS, pages 287-321, 2000.
    • (2000) Proc. SPIN Workshop , vol.1885 , pp. 287-321
    • Ruys, T.C.1
  • 29
    • 84863899988 scopus 로고    scopus 로고
    • Using magnatic disk instead of main memory in the Murphi verifier
    • Proc. Computer Aided Verification (CAV 1998)
    • U. Stern and D. L. Dill. Using magnatic disk instead of main memory in the Murphi verifier. In Proc. Computer Aided Verification (CAV 1998), volume 1427 of LNCS, pages 172-183, 1998.
    • (1998) LNCS , vol.1427 , pp. 172-183
    • Stern, U.1    Dill, D.L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.