메뉴 건너뛰기




Volumn 2607, Issue , 2003, Pages 620-631

Untameable timed automata! (extended abstract)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; INTERACTIVE COMPUTER SYSTEMS;

EID: 35248868359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_54     Document Type: Article
Times cited : (59)

References (36)
  • 2
    • 85027622491 scopus 로고
    • Minimization of Timed Transition Systems
    • Proc. 3rd International Conference on Concurrency Theory (CONCUR'92), Springer
    • Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, David Dill and Howard Wong-Toi. Minimization of Timed Transition Systems. In Proc. 3rd International Conference on Concurrency Theory (CONCUR'92), vol. 630 of Lecture Notes in Computer Science, pp. 340-354. Springer, 1992.
    • (1992) Lecture Notes in Computer Science , vol.630 , pp. 340-354
    • Alur, R.1    Courcoubetis, C.2    Halbwachs, N.3    Dill, D.4    Wong-Toi, H.5
  • 3
    • 85026870751 scopus 로고
    • The Observational Power of Clocks
    • Proc. 5th International Conference on Concurrency Theory (CONCUR'94), Springer
    • Rajeev Alur, Costas Courcoubetis and Thomas A. Henzinger. The Observational Power of Clocks. In Proc. 5th International Conference on Concurrency Theory (CONCUR'94), vol. 836 of Lecture Notes in Computer Science, pp. 162-177. Springer, 1994.
    • (1994) Lecture Notes in Computer Science , vol.836 , pp. 162-177
    • Alur, R.1    Courcoubetis, C.2    Henzinger, T.A.3
  • 4
  • 5
    • 85028755887 scopus 로고
    • A Determinizable Class of Timed Automata
    • Proc. 6th International Conference on Computer Aided Verification (CAV'94), Springer
    • Rajeev Alur, Limor Fix and Thomas A. Henzinger. A Determinizable Class of Timed Automata. In Proc. 6th International Conference on Computer Aided Verification (CAV'94), vol. 818 of Lecture Notes in Computer Science, pp. 1-13. Springer, 1994.
    • (1994) Lecture Notes in Computer Science , vol.818 , pp. 1-13
    • Alur, R.1    Fix, L.2    Henzinger, T.A.3
  • 6
    • 3543140141 scopus 로고    scopus 로고
    • Analysing the PGM Protocol with UPPAAL
    • Proc. published as Technical Report 2002-025, Uppsala University, Sweden
    • Béatrice Bérard, Patricia Bouyer and Antoine Petit. Analysing the PGM Protocol with UPPAAL. In Proc. 2nd Workshop on Real-Time Tools (RT-TOOLS'02). 2002. Proc. published as Technical Report 2002-025, Uppsala University, Sweden.
    • (2002) Proc. 2nd Workshop on Real-Time Tools (RT-TOOLS'02)
    • Bérard, B.1    Bouyer, P.2    Petit, A.3
  • 7
    • 84944406327 scopus 로고    scopus 로고
    • Are Timed Automata Updatable?
    • Proc. 12th International Conference on Computer Aided Verification (CAV'2000), Springer
    • Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury and Antoine Petit. Are Timed Automata Updatable?. In Proc. 12th International Conference on Computer Aided Verification (CAV'2000), vol. 1855 of Lecture Notes in Computer Science, pp. 464-479. Springer, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1855 , pp. 464-479
    • Bouyer, P.1    Dufourd, C.2    Fleury, E.3    Petit, A.4
  • 8
    • 0000767643 scopus 로고    scopus 로고
    • Characterization of the Expressive Power of Silent Transitions in Timed Automata
    • Béatrice Bérard, Volker Diekert, Paul Gastin and Antoine Petit. Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae, vol. 36(2-3):pp. 145-182, 1998.
    • (1998) Fundamenta Informaticae , vol.36 , Issue.2-3 , pp. 145-182
    • Bérard, B.1    Diekert, V.2    Gastin, P.3    Petit, A.4
  • 9
    • 3543102698 scopus 로고    scopus 로고
    • Ph.D. thesis, Department of Information Technology, Uppsala University, Uppsala, Sweden
    • Johan Bengtsson. Clocks, DBMs ans States in Timed Systems. Ph.D. thesis, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2002.
    • (2002) Clocks, DBMs Ans States in Timed Systems
    • Bengtsson, J.1
  • 10
    • 84944256570 scopus 로고    scopus 로고
    • Minimum-Cost Reachability for Priced Timed Automata
    • Proc. 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), Springer
    • +01] Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim G. Larsen, Paul Pettersson, Judi Romijn and Frits Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. In Proc. 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), vol. 2034 of Lecture Notes in Computer Science, pp. 147-161. Springer, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2034 , pp. 147-161
    • Behrmann, G.1    Fehnker, A.2    Hune, T.3    Larsen, K.G.4    Pettersson, P.5    Romijn, J.6    Vaandrager, F.7
  • 12
    • 84947274672 scopus 로고    scopus 로고
    • Efficient Timed Reachability Analysis Using Clock Difference Diagrams
    • Proc. 11th International Conference on Computer Aided Verification (CAV'99), Springer
    • Gerd Behrmann, Kim G. Larsen, Justin Pearson, Carsten Weise and Wang Yi. Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Proc. 11th International Conference on Computer Aided Verification (CAV'99), vol. 1633 of Lecture Notes in Computer Science, pp. 341-353. Springer, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1633 , pp. 341-353
    • Behrmann, G.1    Larsen, K.G.2    Pearson, J.3    Weise, C.4    Yi, W.5
  • 14
    • 33646696342 scopus 로고    scopus 로고
    • Research Report LSV-02-9, Laboratoire Spécification et Vérification, ENS de Cachan, France, 2002. Also Available as BRICS Research Report RS-02-35, Aalborg University, Denmark
    • Patricia Bouyer. Timed Automata May Cause Some Troubles. Research Report LSV-02-9, Laboratoire Spécification et Vérification, ENS de Cachan, France, 2002. Also Available as BRICS Research Report RS-02-35, Aalborg University, Denmark, 2002.
    • (2002) Timed Automata May Cause Some Troubles
    • Bouyer, P.1
  • 20
    • 84944099472 scopus 로고
    • Timing Assumptions and Verification of Finite-State Concurrent Systems
    • Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, Springer
    • David Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems: In Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, vol. 407 of Lecture Notes in Computer Science, pp. 197-212. Springer, 1989.
    • (1989) Lecture Notes in Computer Science , vol.407 , pp. 197-212
    • Dill, D.1
  • 21
    • 40149092144 scopus 로고    scopus 로고
    • The Tool
    • KRONOS. Proc. Hybrid Systems III: Verification and Control (1995), Springer
    • Conrado Daws, Alfredo Olivero, Stavros Tripakis and Sergio Yovine. The Tool KRONOS. In Proc. Hybrid Systems III: Verification and Control (1995), vol. 1066 of Lecture Notes in Computer Science, pp. 208-219. Springer, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1066 , pp. 208-219
    • Daws, C.1    Olivero, A.2    Tripakis, S.3    Yovine, S.4
  • 22
    • 84947909489 scopus 로고    scopus 로고
    • Model-Checking of Real-Time Reachability Properties using Abstractions
    • Proc. 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), Springer
    • Conrado Daws and Stavros Tripakis. Model-Checking of Real-Time Reachability Properties using Abstractions. In Proc. 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), vol. 1384 of Lecture Notes in Computer Science, pp. 313-329. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1384 , pp. 313-329
    • Daws, C.1    Tripakis, S.2
  • 23
    • 84945915318 scopus 로고    scopus 로고
    • Controlled Timed Automata
    • Proc. 9th International Conference on Concurrency Theory (CONCUR '98), Springer
    • François Demichelis and Wieslaw Zielonka. Controlled Timed Automata. In Proc. 9th International Conference on Concurrency Theory (CONCUR '98), vol. 1466 of Lecture Notes in Computer Science, pp. 455-469. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1466 , pp. 455-469
    • Demichelis, F.1    Zielonka, W.2
  • 25
    • 84958040431 scopus 로고
    • The Expressive Power of Clocks
    • Proc. 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), Springer
    • Thomas A. Henzinger, Peter W. Kopke and Howard Wong-Toi. The Expressive Power of Clocks. In Proc. 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), vol. 944 of Lecture Notes in Computer Science, pp. 417-428. Springer, 1995.
    • (1995) Lecture Notes in Computer Science , vol.944 , pp. 417-428
    • Thomas, A.1    Henzinger2    Kopke, P.W.3    Wong-Toi, H.4
  • 26
    • 84878576366 scopus 로고    scopus 로고
    • The Regular Real-Time Languages
    • Proc. 25th International Colloquium on Automata, Languages and Programming (ICALP'98), Springer
    • Thomas A. Henzinger, Jean-François Raskin and Pierre-Yves Schobbens. The Regular Real-Time Languages. In Proc. 25th International Colloquium on Automata, Languages and Programming (ICALP'98), vol. 1443 of Lecture Notes in Computer Science, pp. 580-591. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1443 , pp. 580-591
    • Henzinger, T.A.1    Raskin, J.-F.2    Schobbens, P.-Y.3
  • 27
    • 0031354378 scopus 로고    scopus 로고
    • Formal Modeling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using
    • UPPAAL IEEE Computer Society Press
    • Klaus Havelund, Arne Skou, Kim G. Larsen and Kristian Lund. Formal Modeling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using UPPAAL. In Proc. 18th IEEE Real-Time Systems Symposium (RTSS'97), pp. 2-13. IEEE Computer Society Press, 1997.
    • (1997) Proc. 18th IEEE Real-Time Systems Symposium (RTSS'97) , pp. 2-13
    • Havelund, K.1    Skou, A.2    Larsen, K.G.3    Lund, K.4
  • 31
    • 0031641195 scopus 로고    scopus 로고
    • Verification of the Fast Reservation Protocol with Delayed Transmission using the Tool KRONOS
    • IEEE Computer Society Press
    • Stavros Tripakis and Sergio Yovine. Verification of the Fast Reservation Protocol with Delayed Transmission using the Tool KRONOS. In Proc. 4th IEEE Real-Time Technology and Applications Symposium (RTAS'98), pp. 165-170. IEEE Computer Society Press, 1998.
    • (1998) Proc. 4th IEEE Real-Time Technology and Applications Symposium (RTAS'98) , pp. 165-170
    • Tripakis, S.1    Yovine, S.2
  • 32
    • 0035135204 scopus 로고    scopus 로고
    • Analysis of Timed Systems using Time-Abstracting Bisimulations
    • Stavros Tripakis and Sergio Yovine. Analysis of Timed Systems using Time-Abstracting Bisimulations. Formal Methods in System Design, vol. 18(1):pp. 25-68, 2001.
    • (2001) Formal Methods in System Design , vol.18 , Issue.1 , pp. 25-68
    • Tripakis, S.1    Yovine, S.2
  • 33
    • 85005984698 scopus 로고
    • Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
    • Proc. 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'94), Springer
    • Thomas Wilke. Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. In Proc. 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'94), vol. 863 of Lecture Notes in Computer Science, pp. 694-715. Springer, 1994.
    • (1994) Lecture Notes in Computer Science , vol.863 , pp. 694-715
    • Wilke, T.1
  • 35
    • 0031211767 scopus 로고    scopus 로고
    • An Efficient Algorithm for Minimizing Real-Time Transition Systems. F
    • Mihalis Yannakakis and David Lee. An Efficient Algorithm for Minimizing Real-Time Transition Systems. Formal Methods in System Design, vol. 11(2):pp. 113-136, 1997.
    • (1997) Ormal Methods in System Design , vol.11 , Issue.2 , pp. 113-136
    • Yannakakis, M.1    Lee, D.2
  • 36
    • 84958967825 scopus 로고    scopus 로고
    • Model-Checking Timed Automata
    • School on Embedded Systems, Springer
    • Sergio Yovine. Model-Checking Timed Automata. In School on Embedded Systems, vol. 1494 of Lecture Notes in Computer Science, pp. 114-152. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1494 , pp. 114-152
    • Yovine, S.1


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