메뉴 건너뛰기




Volumn 2469, Issue , 2002, Pages 3-22

UPPAAL implementation secrets

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; INTERACTIVE COMPUTER SYSTEMS; STATE SPACE METHODS;

EID: 84974695996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45739-9_1     Document Type: Conference Paper
Times cited : (51)

References (44)
  • 6
  • 8
    • 84957375295 scopus 로고    scopus 로고
    • Verification of an Audio Protocol with Bus Collision Using Uppaal
    • Rajeev Alur and Thomas A. Henzinger, editors, in Lecture Notes in Computer Science, Springer-Verlag, July
    • Johan Bengtsson, W.O. David Griffioen, Kåre J. Kristoffersen, Kim G. Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. Verification of an Audio Protocol with Bus Collision Using Uppaal. In Rajeev Alur and Thomas A. Henzinger, editors, Proc. of the 8th Int. Conf. on Computer Aided Verification, number 1102 in Lecture Notes in Computer Science, pages 244-256. Springer-Verlag, July 1996.
    • (1996) Proc. of the 8th Int. Conf. on Computer Aided Verification , Issue.1102 , pp. 244-256
    • Bengtsson, J.1    David Griffioen, W.O.2    Kristoffersen, K.J.3    Larsen, K.G.4    Larsson, F.5    Pettersson, P.6    Yi, W.7
  • 11
    • 84947274672 scopus 로고    scopus 로고
    • Efficient Timed Reachability Analysis Using Clock Difference Diagrams
    • Lecture Notes in Computer Science. Springer-Verlag
    • Gerd Behrmann, Kim G. Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Proc. of the 11th Int. Conf. on Computer Aided Verification, number 1633 in Lecture Notes in Computer Science. Springer-Verlag, 1999.
    • (1999) Proc. of the 11th Int. Conf. on Computer Aided Verification , Issue.1633
    • Behrmann, G.1    Larsen, K.G.2    Pearson, J.3    Weise, C.4    Yi, W.5
  • 12
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. on Computers, 1986.
    • (1986) IEEE Trans. on Computers
    • Bryant, R.E.1
  • 16
    • 84944099472 scopus 로고
    • Timing Assumptions and Verification of Finite-State Concurrent Systems
    • J. Sifakis, editor, in Lecture Notes in Computer Science, Springer-Verlag
    • David Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. In J. Sifakis, editor, Proc. of Automatic Verification Methods for Finite State Systems, number 407 in Lecture Notes in Computer Science, pages 197-212. Springer-Verlag, 1989.
    • (1989) Proc. of Automatic Verification Methods for Finite State Systems , Issue.407 , pp. 197-212
    • Dill, D.1
  • 18
    • 0029488677 scopus 로고
    • Two examples of verification of multirate timed automata with Kronos
    • IEEE Computer Society Press, December
    • th IEEE Real-Time Systems Symposium, pages 66-75. IEEE Computer Society Press, December 1995.
    • (1995) th IEEE Real-Time Systems Symposium , pp. 66-75
    • Daws, C.1    Yovine, S.2
  • 22
    • 0018005391 scopus 로고
    • Communicating Sequential Processes
    • C.A.R. Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8): 666-677, 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.8 , pp. 666-677
    • Hoare, C.A.R.1
  • 24
    • 18944406629 scopus 로고    scopus 로고
    • Modeling a language for embedded systems in timed automata
    • Technical Report RS-00-17, BRICS, Basic Research in computer Science, August
    • Thomas S. Hune. Modeling a language for embedded systems in timed automata. Technical Report RS-00-17, BRICS, Basic Research in computer Science, August 2000. 26 pp. Earlier version entitled Modelling a Real-Time Language appeared in FMICS99, pages 259-282.
    • (2000) Earlier version entitled Modelling a Real-Time Language appeared in FMICS99
    • Hune, T.S.1
  • 27
    • 84976735431 scopus 로고
    • Tentative steps toward a development method for interfering programs
    • C. Jones. Tentative steps toward a development method for interfering programs. ACM Transactions on Programming Languages and Systems, 5(4): 596-620, 1983.
    • (1983) ACM Transactions on Programming Languages and Systems , vol.5 , Issue.4 , pp. 596-620
    • Jones, C.1
  • 28
    • 0023288130 scopus 로고
    • A Fast Mutual Exclusion Algorithm
    • February, Also appeared as SRC Research Report 7
    • Leslie Lamport. A Fast Mutual Exclusion Algorithm. ACM Trans. on Computer Systems, 5(1): 1-11, February 1987. Also appeared as SRC Research Report 7.
    • (1987) ACM Trans. on Computer Systems , vol.5 , Issue.1 , pp. 1-11
    • Lamport, L.1
  • 38
    • 0017173886 scopus 로고
    • An Axiomatic Proof Technique for Parallel Programs I
    • S. Owicki and D. Gries. An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica, 6(4): 319-340, 1976.
    • (1976) Acta Informatica , vol.6 , Issue.4 , pp. 319-340
    • Owicki, S.1    Gries, D.2


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