메뉴 건너뛰기




Volumn 1427 LNCS, Issue , 1998, Pages 207-218

Model checking LTL using net unforldings

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; PETRI NETS; SEMANTICS; ALGORITHMS;

EID: 22044456643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028746     Document Type: Conference Paper
Times cited : (16)

References (22)
  • 3
    • 0018465825 scopus 로고
    • Inproved algorithm for decentralised extrema-finding in circular distributed systems
    • DOI 10.1145/359104.359108
    • E. Chang, R. Roberts. An Inproved Algorithm for Decentralised Extrema-finding in Circular Distributed Systems. Communication of the ACM, 22(5):281-283, 1979. (Pubitemid 9461372)
    • (1979) Commun ACM , vol.22 , Issue.5 , pp. 281-283
    • Chang Ernest1    Roberts Rosemary2
  • 4
    • 0026191448 scopus 로고
    • Branching processes of Petri nets
    • J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575-591, 1991. (Pubitemid 21693790)
    • (1991) Acta Informatica , vol.28 , Issue.6 , pp. 575-591
    • Engelfriet Joost1
  • 5
    • 0028756614 scopus 로고
    • Model checking using net unfoldings
    • J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23:151-195, 1994.
    • (1994) Science of Computer Programming , vol.23 , pp. 151-195
    • Esparza, J.1
  • 6
    • 84958970010 scopus 로고    scopus 로고
    • Model checking LTL using constraint programming
    • Application and Theory of Petri Nets 1997
    • J. Esparza, S. Melzer. Model Checking LTL Using Constraint Programming. In Proc. of 18th Int. Conf. on Application and Theory of Petri Nets, LNCS 1248, pp. 1-20, 1997. (Pubitemid 127088932)
    • (1997) Lecture Notes in Computer Science , Issue.1248 , pp. 1-20
    • Esparza, J.1    Melzer, S.2
  • 7
    • 1542427122 scopus 로고    scopus 로고
    • An improvement of McMillan's unfolding algorithm
    • Tools and Algorithms for the Construction and Analysis of Systems
    • J. Esparza, S. Römer, W. Vogler. An Improvement of McMillan's Unfolding Algorithm. In Tools and Algorithms for the Construction and Analysis of Systems TAC AS '96, LNCS 1055, pp. 87-106, 1996. (Pubitemid 126050410)
    • (1996) Lecture Notes in Computer Science , Issue.1055 , pp. 87-106
    • Esparza, J.1    Roemaer, S.2    Vogler, W.3
  • 12
    • 84947442096 scopus 로고    scopus 로고
    • Relaxed visibility enhances partial order reduction
    • Computer Aided Verification
    • I. Kokkarinen, D. Peled, A. Valmari. Relaxed Visibility Enhances Partial Order Reduction. In Proc. of 9th Computer-Aided Verification CAV'97, LNCS 1254, pp. 328-339, 1997. (Pubitemid 127088989)
    • (1997) Lecture Notes in Computer Science , Issue.1254 , pp. 328-339
    • Kokkarinen, I.1    Peled, D.2    Valmari, A.3
  • 13
    • 0020910824 scopus 로고
    • What good is temporal logic?
    • L. Lamport. What good is temporal logic? Information Processing 83, pp. 657-668, 1983. (Pubitemid 14559898)
    • (1983) IFIP Congress Series , vol.9 , pp. 657-668
    • Lamport Leslie1
  • 14
    • 33847258494 scopus 로고
    • Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits
    • LNCS 663
    • K.L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Proc. 4th Workshop on Computer-Aided Verification, LNCS 663, pp. 164-174, 1992.
    • (1992) Proc. 4th Workshop on Computer-aided Verification , pp. 164-174
    • McMillan, K.L.1
  • 16
    • 85010991128 scopus 로고
    • All from one, one for all: On model checking using representatives
    • LNCS 697
    • D. Peled. All from one, one for all: on model checking using representatives. In Proc. of 5th Computer-Aided Verification CAV'93, LNCS 697, pp. 409-423, 1993.
    • (1993) Proc. of 5th Computer-aided Verification CAV'93 , pp. 409-423
    • Peled, D.1
  • 17
    • 70350750512 scopus 로고
    • Combining partial order reductions with on-the-fiy model checking
    • LNCS 818
    • D. Peled. Combining partial order reductions with on-the-fiy model checking. In Proc. of 6th Computer-Aided Verification CAV'94, LNCS 818, pp. 377-390, 1994.
    • (1994) Proc. of 6th Computer-aided Verification CAV'94 , pp. 377-390
    • Peled, D.1
  • 18
    • 0001176166 scopus 로고
    • A stubborn attack on state explosion
    • A. Valmari. A Stubborn Attack on State Explosion. Formal Methods in System Design, 1:297-322, 1992.
    • (1992) Formal Methods in System Design , vol.1 , pp. 297-322
    • Valmari, A.1
  • 21
    • 33749205715 scopus 로고
    • On the relations on programs and computations to models of temporal logic
    • LNCS 398
    • P. Wolper. On the relations on programs and computations to models of temporal logic. In Proc. of Temporal Logic in Specification, LNCS 398, pp. 75-123, 1989.
    • (1989) Proc. of Temporal Logic in Specification , pp. 75-123
    • Wolper, P.1


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