메뉴 건너뛰기




Volumn 7, Issue 1, 2005, Pages 31-42

Parallel search for LTL violations

Author keywords

Biologically inspired algorithms; Explicit model checking; Semiformal verification

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; COMPUTER WORKSTATIONS; DATA STORAGE EQUIPMENT; FORMAL LOGIC; PROBABILITY DISTRIBUTIONS;

EID: 13844313093     PISSN: 14332779     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10009-003-0115-8     Document Type: Article
Times cited : (15)

References (19)
  • 1
    • 13844321824 scopus 로고    scopus 로고
    • Distributed LTL model-checking in SPIN
    • Technical Report FIMU-RS-2000-10 Faculty of Informatics, Masaryk University, Brno, Czech Republic
    • Barnat J, Brim L, Stříbrná J (2000) Distributed LTL model-checking in SPIN. Technical Report FIMU-RS-2000-10, Faculty of Informatics, Masaryk University, Brno, Czech Republic
    • (2000)
    • Barnat, J.1    Brim, L.2    Stříbrná, J.3
  • 2
    • 0027340946 scopus 로고
    • The pattern and effectiveness of forager allocation among flower patches by honey bee colonies
    • Bartholdi III JJ, Seeley TD, Tovey CA, Vande Vate JH (1993) The pattern and effectiveness of forager allocation among flower patches by honey bee colonies. J Theor Biol 160:23-40
    • (1993) J. Theor. Biol. , vol.160 , pp. 23-40
    • Bartholdi III, J.J.1    Seeley, T.D.2    Tovey, C.A.3    Vande Vate, J.H.4
  • 4
    • 84957810389 scopus 로고    scopus 로고
    • Randomization helps in LTL model checking
    • Aachen, Germany, 12-14 September 2001. Lecture notes in computer science Springer, Berlin Heidelberg New York
    • Brim L, Cerna I, Necesal M (2001) Randomization helps in LTL model checking. In: Proceedings of the PAPM-PROBMIV workshop, Aachen, Germany, 12-14 September 2001. Lecture notes in computer science, vol 2165, Springer, Berlin Heidelberg New York
    • (2001) Proceedings of the PAPM-PROBMIV Workshop , vol.2165
    • Brim, L.1    Cerna, I.2    Necesal, M.3
  • 5
    • 0003962322 scopus 로고    scopus 로고
    • Model checking
    • MIT Press Cambridge, MA
    • Clarke EM, Grumberg O, Peled D (2000) Model checking. MIT Press, Cambridge, MA
    • (2000)
    • Clarke, E.M.1    Grumberg, O.2    Peled, D.3
  • 6
    • 84957366356 scopus 로고    scopus 로고
    • The Murø verification system
    • Alur R Henzinger TA (eds.) New Brunswick, NJ, July/August 1996. Lecture notes in computer science Springer, Berlin Heidelberg New York
    • Dill DL (1996) The Murø verification system. In: Alur R, Henzinger TA (eds) Proceedings of Computer Aided Verification (CAV'96), New Brunswick, NJ, July/August 1996. Lecture notes in computer science, vol 1102, Springer, Berlin Heidelberg New York, pp 390-393
    • (1996) Proceedings of Computer Aided Verification (CAV'96) , vol.1102 , pp. 390-393
    • Dill, D.L.1
  • 7
    • 0000873984 scopus 로고    scopus 로고
    • Antnet: Distributed stigmergetic control for communications networks
    • Di Caro G, Dorigo M (1998) Antnet: Distributed stigmergetic control for communications networks. J Artif Intell Res 9:317-365
    • (1998) J. Artif. Intell. Res. , vol.9 , pp. 317-365
    • Di Caro, G.1    Dorigo, M.2
  • 8
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Artif Life 5(2):137-172
    • (1999) Artif. Life , vol.5 , Issue.2 , pp. 137-172
    • Dorigo, M.1    Di Caro, G.2    Gambardella, L.M.3
  • 9
    • 0033725598 scopus 로고    scopus 로고
    • Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems
    • Limerick Ireland, 4-11 June 2000. IEEE Press, New York
    • Dang Z, Kemmerer R (2000) Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems. In: Proceedings of the 22nd international conference on software engineering (ICSE00), Limerick Ireland, 4-11 June 2000. IEEE Press, New York, pp 345-354
    • (2000) Proceedings of the 22nd International Conference on Software Engineering (ICSE00) , pp. 345-354
    • Dang, Z.1    Kemmerer, R.2
  • 10
    • 84894638887 scopus 로고    scopus 로고
    • Directed explicit model checking with HSF-SPIN
    • Toronto, Canada, 19-20 May 2001. Lecture notes in computer science Springer, Berlin Heidelberg New York
    • Edelkamp S, Lluch-Lafuente A, Leue S (2001) Directed explicit model checking with HSF-SPIN. In: Proceedings of the 8th international SPIN workshop on model checking software, Toronto, Canada, 19-20 May 2001. Lecture notes in computer science, vol 2057, Springer, Berlin Heidelberg New York
    • (2001) Proceedings of the 8th International SPIN Workshop on Model Checking Software , vol.2057
    • Edelkamp, S.1    Lluch-Lafuente, A.2    Leue, S.3
  • 11
    • 0013007059 scopus 로고    scopus 로고
    • Distributed symbolic model checking for the μ-calculus
    • Paris, 18-23 July 2001. Lecture notes in computer science Springer, Berlin Heidelberg New York
    • Grumberg O, Heyman T, Schuster A (2001) Distributed symbolic model checking for the μ-calculus. In: Proceedings of Computer Aided Verification 2001 (CAV'01), Paris, 18-23 July 2001. Lecture notes in computer science, vol 2102, Springer, Berlin Heidelberg New York
    • (2001) Proceedings of Computer Aided Verification 2001 (CAV'01) , vol.2102
    • Grumberg, O.1    Heyman, T.2    Schuster, A.3
  • 12
    • 13844320466 scopus 로고    scopus 로고
    • Model checking by random walk
    • Available at:
    • Haslum P (1999) Model checking by random walk. Available at: http://www.ida.liu.se/~pahas/public/ccsse99.ps.gz
    • (1999)
    • Haslum, P.1
  • 13
    • 0032209123 scopus 로고    scopus 로고
    • An analysis of bitstate hashing
    • Holzmann GJ (1998) An analysis of bitstate hashing. Formal Meth Sys Design 13(3):289-307
    • (1998) Formal Meth. Sys. Design , vol.13 , Issue.3 , pp. 289-307
    • Holzmann, G.J.1
  • 14
    • 11244324791 scopus 로고    scopus 로고
    • Distributed-memory model checking in SPIN
    • Trento, Italy, 5 July 1999. Lecture notes in computer science Springer, Berlin Heidelberg New York
    • Lerda F, Sisto R (1999) Distributed-memory model checking in SPIN. In: Proceedings of the SPIN workshop, Trento, Italy, 5 July 1999. Lecture notes in computer science, vol 1680, Springer, Berlin Heidelberg New York
    • (1999) Proceedings of the SPIN Workshop , vol.1680
    • Lerda, F.1    Sisto, R.2
  • 16
    • 0003635090 scopus 로고
    • The wisdom of the hive: The social biology of honey bee colonies
    • Harvard University Press, Cambridge, MA
    • Seeley TD (1995) The wisdom of the hive: The social biology of honey bee colonies. Harvard University Press, Cambridge, MA
    • (1995)
    • Seeley, T.D.1
  • 17
    • 0024195535 scopus 로고
    • Assessing the benefits of cooperation in honeybee foraging: Search costs, forage quality and competitive ability
    • Seeley TD, Visscher PK (1988) Assessing the benefits of cooperation in honeybee foraging: Search costs, forage quality and competitive ability. Behav Ecol Sociobiol 22:229-237
    • (1988) Behav. Ecol. Sociobiol. , vol.22 , pp. 229-237
    • Seeley, T.D.1    Visscher, P.K.2
  • 18
    • 0025953263 scopus 로고
    • Collective decision-making in honey bees: How colonies choose amung nectar sources
    • Seeley TD, Camazine S, Sneyd J (1991) Collective decision-making in honey bees: How colonies choose amung nectar sources. Behav Ecol Sociobiol 28:277-290
    • (1991) Behav. Ecol. Sociobiol. , vol.28 , pp. 277-290
    • Seeley, T.D.1    Camazine, S.2    Sneyd, J.3
  • 19
    • 84947425596 scopus 로고    scopus 로고
    • Parallelizing the Murø verifier
    • Grumburg O (ed) Haifa, Israel, June 1997. Lecture notes in computer science Springer, Berlin Heidelberg New York
    • Stern U, Dill DL (1997) Parallelizing the Murø verifier. In: Grumburg O (ed) Proceedings of Computer Aided Verification (CAV'97), Haifa, Israel, June 1997. Lecture notes in computer science, vol 1254, Springer, Berlin Heidelberg New York, pp 256-267
    • (1997) Proceedings of Computer Aided Verification (CAV'97) , vol.1254 , pp. 256-267
    • Stern, U.1    Dill, D.L.2


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