메뉴 건너뛰기




Volumn 3707 LNCS, Issue , 2005, Pages 370-384

Model checking prioritized timed automata

Author keywords

DBM subtraction; Prioritized timed automata; Zone merging; Zone reduction

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; SPECIFICATIONS;

EID: 33646166591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562948_28     Document Type: Conference Paper
Times cited : (13)

References (24)
  • 2
    • 0036642305 scopus 로고    scopus 로고
    • Scheduler modeling based on the controller synthesis paradigm
    • K. Altisen, G. Gössler, and J. Sifakis. Scheduler modeling based on the controller synthesis paradigm. Real-Time Systems, 23:55-84, 2002.
    • (2002) Real-time Systems , vol.23 , pp. 55-84
    • Altisen, K.1    Gössler, G.2    Sifakis, J.3
  • 5
    • 33646187329 scopus 로고
    • Syntax and defining equations for an interrupt mechanism in process algebra
    • Centre for Mathematics and Computer Science, Amsterdam, The Netherlands
    • J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Technical Report CS-R8503, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1985.
    • (1985) Technical Report , vol.CS-R8503
    • Baeten, J.C.M.1    Bergstra, J.A.2    Klop, J.W.3
  • 7
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • August
    • R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 8
    • 33646205295 scopus 로고
    • Introducing a priority operators to ces
    • Cambridge
    • J. Camilleri. Introducing a priority operators to ces. Technical Report 157, Cambridge, 1989.
    • (1989) Technical Report , vol.157
    • Camilleri, J.1
  • 9
    • 85037030721 scopus 로고
    • Design and sythesis of synchronization skeletons using branching time temporal logic
    • volume 131 of LNCS, Springer Verlag
    • E.M. Clarke and E.A. Emerson. Design and sythesis of synchronization skeletons using branching time temporal logic. In Proceedings of the Logics of Programs Workshop, volume 131 of LNCS, pages 52-71. Springer Verlag, 1981.
    • (1981) Proceedings of the Logics of Programs Workshop , pp. 52-71
    • Clarke, E.M.1    Emerson, E.A.2
  • 12
  • 16
    • 0003591005 scopus 로고
    • PhD thesis, St. Hugh's College, University of Oxford, Hilary Term
    • G. Lowe. Probabilities and Priorities in Timed CSP. PhD thesis, St. Hugh's College, University of Oxford, Hilary Term, 1993.
    • (1993) Probabilities and Priorities in Timed CSP
    • Lowe, G.1
  • 18
    • 0020299274 scopus 로고
    • Specification and verification of concurrent systems in CESAR
    • Proceedings of the International Symposium on Programming, Springer Verlag
    • J.-P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proceedings of the International Symposium on Programming, volume 137 of LNCS, pages 337-351. Springer Verlag, 1982.
    • (1982) LNCS , vol.137 , pp. 337-351
    • Queille, J.-P.1    Sifakis, J.2
  • 21
    • 35048819139 scopus 로고    scopus 로고
    • RED: Model-checker for timed automata with clock-restriction diagram
    • August
    • F.Wang. RED: Model-checker for timed automata with clock-restriction diagram. In Proceedings of the Workshop on Real-Time Tools, August 2001.
    • (2001) Proceedings of the Workshop on Real-time Tools
    • Wang, F.1
  • 22
    • 33646188362 scopus 로고    scopus 로고
    • ISSN 1404-3203, Department of Information Technology, Uppsala University
    • Technical Report 2001-014, ISSN 1404-3203, Department of Information Technology, Uppsala University.
    • Technical Report , vol.2001 , Issue.14
  • 23
    • 0036158371 scopus 로고    scopus 로고
    • Efficient and user-friendly verification
    • January
    • F. Wang and P.-A. Hsiung. Efficient and user-friendly verification. IEEE Transactions on Computers, 51(1):61-83, January 2002.
    • (2002) IEEE Transactions on Computers , vol.51 , Issue.1 , pp. 61-83
    • Wang, F.1    Hsiung, P.-A.2


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