메뉴 건너뛰기




Volumn 18, Issue 1, 2001, Pages 25-68

Analysis of timed systems using time-abstracting bisimulations

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY;

EID: 0035135204     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008734703554     Document Type: Article
Times cited : (129)

References (49)
  • 1
    • 0343755495 scopus 로고
    • An implementation of three algorithms for timing verification based on automata emptiness
    • A. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi, "An implementation of three algorithms for timing verification based on automata emptiness," in RTSS'92. IEEE, 1992.
    • (1992) RTSS'92. IEEE
    • Alur, A.1    Courcoubetis, C.2    Dill, D.3    Halbwachs, N.4    Wong-Toi, H.5
  • 4
    • 85031771187 scopus 로고
    • Automata for modeling real-time systems
    • LNCS
    • R. Alur and D. Dill, "Automata for modeling real-time systems," in 17th ICALP, LNCS, Vol. 443, 1990.
    • (1990) 17th ICALP , vol.443
    • Alur, R.1    Dill, D.2
  • 5
    • 84968436089 scopus 로고
    • An old-fashioned recipe for real time
    • LNCS, Springer-Verlag
    • M. Abadi and L. Lamport, "An old-fashioned recipe for real time," in REX workshop "Real-time: Theory in Practice". LNCS, Vol. 600, Springer-Verlag, 1991, pp. 1-27.
    • (1991) REX workshop "Real-time: Theory in Practice" , vol.600 , pp. 1-27
    • Abadi, M.1    Lamport, L.2
  • 10
    • 0005277420 scopus 로고    scopus 로고
    • Efficient timed reachability analysis using clock difference diagrams
    • G. Behrmann, K. Larsen, J. Pearson, C. Weise, and W. Yi, "Efficient timed reachability analysis using clock difference diagrams," in CAV'99, 1999.
    • (1999) CAV'99
    • Behrmann, G.1    Larsen, K.2    Pearson, J.3    Weise, C.4    Yi, W.5
  • 11
    • 0342884673 scopus 로고    scopus 로고
    • Ph.D. Thesis, Université Joseph Fourrier de Grenoble, In French
    • S. Bornot, "De la composition des systèmes hybrides," Ph.D. Thesis, Université Joseph Fourrier de Grenoble, 1998. In French.
    • (1998) De la Composition des Systèmes Hybrides
    • Bornot, S.1
  • 12
    • 84957685266 scopus 로고    scopus 로고
    • Relating time progress and deadlines in hybrid systems
    • Lecture Notes in Computer Science, Grenoble, France, March Spinger-Verlag
    • S. Bornot and J. Sifakis, "Relating time progress and deadlines in hybrid systems," in International Workshop, HART'97, Grenoble, France, March 1997. Lecture Notes in Computer Science, Vol. 1201, Spinger-Verlag, pp. 286-300.
    • (1997) International Workshop, HART'97 , vol.1201 , pp. 286-300
    • Bornot, S.1    Sifakis, J.2
  • 13
    • 84949238101 scopus 로고    scopus 로고
    • Modeling urgency in timed systems
    • LNCS, to appear
    • S. Bornot, J. Sifakis, and S. Tripakis, "Modeling urgency in timed systems," in Compositionality, LNCS, Vol. 1536, to appear.
    • Compositionality , vol.1536
    • Bornot, S.1    Sifakis, J.2    Tripakis, S.3
  • 16
    • 0001107626 scopus 로고
    • Memory efficient algorithms for the verification of temporal properties
    • A preliminary version appeared in the Proceedings of CAV'90 (also in, LNCS, Springer Verlag)
    • C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis, "Memory efficient algorithms for the verification of temporal properties," Formal Methods in System Design, Vol. 1, pp. 275-288, 1992. A preliminary version appeared in the Proceedings of CAV'90 (also in, LNCS, Springer Verlag).
    • (1992) Formal Methods in System Design , vol.1 , pp. 275-288
    • Courcoubetis, C.1    Vardi, M.2    Wolper, P.3    Yannakakis, M.4
  • 17
    • 84944099472 scopus 로고
    • Timing assumptions and verification of finite-state concurrent systems
    • Lecture Notes in Computer Science, J. Sifakis (Ed.), Springer-Verlag
    • D.L. Dill, "Timing assumptions and verification of finite-state concurrent systems," in Automatic Verification Methods for Finite State Systems, J. Sifakis (Ed.), Lecture Notes in Computer Science, Vol. 407, Springer-Verlag, 1989, pp. 197-212.
    • (1989) Automatic Verification Methods for Finite State Systems , vol.407 , pp. 197-212
    • Dill, D.L.1
  • 19
    • 0002367651 scopus 로고
    • Design and synthesis of synchronization skeletons using branching-time temporal logic
    • LNCS
    • E.A. Emerson and E. Clarke, "Design and synthesis of synchronization skeletons using branching-time temporal logic," in Workshop on Logic of Programs. LNCS, Vol. 131, 1981.
    • (1981) Workshop on Logic of Programs , vol.131
    • Emerson, E.A.1    Clarke, E.2
  • 21
    • 0001676405 scopus 로고
    • On the fly' verification of behavioural equivalences and preorders
    • Aalborg University, Denmark. LNCS, Springer Verlag
    • J.Cl. Fernandez and L. Mounier, "'On the fly' verification of behavioural equivalences and preorders," in Workshop on Computer-Aided Verification, Aalborg University, Denmark. LNCS, Vol. 575, 1991, Springer Verlag.
    • (1991) Workshop on Computer-Aided Verification , vol.575
    • Fernandez, J.C.1    Mounier, L.2
  • 22
    • 0343755489 scopus 로고
    • Automatic verification of coordinating systems
    • LNCS
    • Z. Har'El and R. Kurshan, "Automatic verification of coordinating systems," in CAV. LNCS, Vol. 407, 1989.
    • (1989) CAV. , vol.407
    • Har'El, Z.1    Kurshan, R.2
  • 25
    • 84863971672 scopus 로고    scopus 로고
    • You assume, we guarantee: Methodology and case studies
    • Lecture Notes in Computer Science, A.J. Hu and M.Y. Vardi (Eds.), Springer-Verlag
    • T.A. Henzinger, S. Qadeer, and S.K. Rajamani, "You assume, we guarantee: Methodology and case studies," in CAV 98: Computer-aided Verification, A.J. Hu and M.Y. Vardi (Eds.), Lecture Notes in Computer Science, Vol. 1427, Springer-Verlag, 1998, pp. 440-451.
    • (1998) CAV 98: Computer-aided Verification , vol.1427 , pp. 440-451
    • Henzinger, T.A.1    Qadeer, S.2    Rajamani, S.K.3
  • 26
    • 85021287423 scopus 로고
    • IEEE. ANSI/IEEE 802.3, ISO/DIS 8802/3. IEEE Computer Society Press
    • IEEE. ANSI/IEEE 802.3, ISO/DIS 8802/3. IEEE Computer Society Press, 1985.
    • (1985)
  • 27
    • 0343319611 scopus 로고
    • A logic of concrete time intervals
    • H. Lewis, "A logic of concrete time intervals," in 5th IEEE Symp. LICS, 1990.
    • (1990) 5th IEEE Symp. LICS
    • Lewis, H.1
  • 28
    • 0031357735 scopus 로고    scopus 로고
    • Efficient verification of real-time systems: Compact data structure and state-space reduction
    • San Francisco, CA, Dec.
    • K. Larsen, F. Larsson, P. Pettersson, and W. Yi, "Efficient verification of real-time systems: Compact data structure and state-space reduction," in Proceedings of the 18th IEEE Real-Time Systems Symposium, San Francisco, CA, Dec. 1997, pp. 14-24.
    • (1997) Proceedings of the 18th IEEE Real-Time Systems Symposium , pp. 14-24
    • Larsen, K.1    Larsson, F.2    Pettersson, P.3    Yi, W.4
  • 31
    • 0343755486 scopus 로고
    • Timed abstracted bisimulation: Implicit specification and decidability
    • K. Larsen and W. Yi, "Timed abstracted bisimulation: Implicit specification and decidability," in Proc. MFPS'93, 1993.
    • (1993) Proc. MFPS'93
    • Larsen, K.1    Yi, W.2
  • 32
    • 0003630836 scopus 로고
    • Lecture Notes in Computer Science, Springer-Verlag
    • R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92 Springer-Verlag, 1980.
    • (1980) A Calculus of Communicating Systems , vol.92
    • Milner, R.1
  • 37
    • 0023566630 scopus 로고
    • Three partition refinement algorithms
    • R. Paige and R. Tarjan, "Three partition refinement algorithms," SIAM Journal on Computing, Vol. 16, No. 6, 1987.
    • (1987) SIAM Journal on Computing , vol.16 , Issue.6
    • Paige, R.1    Tarjan, R.2
  • 38
    • 0024020056 scopus 로고
    • A timed model for communicating sequential processes
    • G.M. Reed and A.W. Roscoe, "A timed model for communicating sequential processes," Theoretical Computer Science, Vol. 58, pp. 249-261, 1988.
    • (1988) Theoretical Computer Science , vol.58 , pp. 249-261
    • Reed, G.M.1    Roscoe, A.W.2
  • 40
    • 84948142906 scopus 로고    scopus 로고
    • Compositional specification of timed systems
    • Lecture Notes in Computer Science, Grenoble, France, Feb. Spinger-Verlag
    • J. Sifakis and S. Yovine, "Compositional specification of timed systems," in 13th Annual Symposium on Theoretical Aspects of Computer Science, STACS'96, Grenoble, France, Feb. 1996. Lecture Notes in Computer Science, Vol. 1046, Spinger-Verlag, pp. 347-359.
    • (1996) 13th Annual Symposium on Theoretical Aspects of Computer Science, STACS'96 , vol.1046 , pp. 347-359
    • Sifakis, J.1    Yovine, S.2
  • 42
    • 0004141908 scopus 로고
    • Prentice Hall, Englewood Cliffs, 2nd edn
    • A.S. Tanenbaum, Computer Networks, Prentice Hall, Englewood Cliffs, 2nd edn, 1989.
    • (1989) Computer Networks
    • Tanenbaum, A.S.1
  • 43
    • 0001790593 scopus 로고
    • Depth first search and linear graph algorithms
    • R. Tarjan, "Depth first search and linear graph algorithms," SIAM Journal on Computing, Vol. 1, No. 2, pp. 146-170, 1972.
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 146-170
    • Tarjan, R.1
  • 44
    • 0342884667 scopus 로고    scopus 로고
    • Ph.D. Thesis, Université Joseph Fourrier de Grenoble
    • S. Tripakis, "The formal analysis of timed systems in practice," Ph.D. Thesis, Université Joseph Fourrier de Grenoble, 1998. Available at www-verimag.imag.fr/PEOPLE/Stavros.Tripakis.
    • (1998) The Formal Analysis of Timed Systems in Practice
    • Tripakis, S.1
  • 45
    • 84957353962 scopus 로고    scopus 로고
    • Analysis of timed systems based on time-abstracting bisimulations
    • Rutgers, NJ. LNCS, Springer-Verlag
    • S. Tripakis and S. Yovine, "Analysis of timed systems based on time-abstracting bisimulations," in Proc. 8th Conference Computer-Aided Verification, CAV'96, Rutgers, NJ. LNCS, Vol. 1102, Springer-Verlag, 1996, pp. 232-243.
    • (1996) Proc. 8th Conference Computer-Aided Verification, CAV'96 , vol.1102 , pp. 232-243
    • Tripakis, S.1    Yovine, S.2
  • 46
    • 0000598334 scopus 로고
    • Decidability of bisimulation equivalence for parallel timer processes
    • Lecture Notes in Computer Science
    • K. Čerāns, "Decidability of bisimulation equivalence for parallel timer processes," in Proceedings of the Fourth Workshop on Computer-Aided Verification, Lecture Notes in Computer Science, 1992.
    • (1992) Proceedings of the Fourth Workshop on Computer-Aided Verification
    • Cerans, K.1
  • 47
    • 85027594526 scopus 로고
    • Real-time behavior of asynchronous agents
    • LNCS
    • W. Yi, "Real-time behavior of asynchronous agents," in Concur'90. LNCS. Vol. 458, 1990.
    • (1990) Concur'90 , vol.458
    • Yi, W.1
  • 48
    • 84883273725 scopus 로고
    • An efficient algorithm for minimizing real-time transition systems
    • Elounda, Greece, June LNCS
    • M. Yannakakis and D. Lee, "An efficient algorithm for minimizing real-time transition systems," in Fifth Conference on Computer-Aided Verification. Elounda, Greece, June 1993, LNCS, Vol. 697.
    • (1993) Fifth Conference on Computer-Aided Verification , vol.697
    • Yannakakis, M.1    Lee, D.2


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