메뉴 건너뛰기




Volumn , Issue , 2008, Pages 217-226

Almost-sure model cheeking of infinite paths in one-clock timed automata

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; INFORMATION THEORY; PROBABILITY; ROBOTS; SEMANTICS;

EID: 51549102440     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.25     Document Type: Conference Paper
Times cited : (31)

References (26)
  • 1
    • 0028413052 scopus 로고
    • A theory of timed automata
    • R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
    • (1994) Theoretical Computer Science , vol.126 , Issue.2 , pp. 183-235
    • Alur, R.1    Dill, D.2
  • 2
    • 24344501346 scopus 로고    scopus 로고
    • Perturbed timed automata
    • Proc. 8th International Workshop on Hybrid Systems: Computation and Control HSCC'05, of, Springer
    • R. Alur, S. La Torre, and P. Madhusudan. Perturbed timed automata. In Proc. 8th International Workshop on Hybrid Systems: Computation and Control (HSCC'05), vol. 3414 of Lecture Notes in Computer Science, pp. 70-85. Springer, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3414 , pp. 70-85
    • Alur, R.1    La Torre, S.2    Madhusudan, P.3
  • 4
    • 38349014207 scopus 로고    scopus 로고
    • Probabilistic and topological semantics for timed automata
    • Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science FSTTCS'07, of, Springer
    • C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Größer. Probabilistic and topological semantics for timed automata. In Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), vol. 4855 of Lecture Notes in Computer Science, pp. 179-191. Springer, 2007.
    • (2007) Lecture Notes in Computer Science , vol.4855 , pp. 179-191
    • Baier, C.1    Bertrand, N.2    Bouyer, P.3    Brihaye, T.4    Größer, M.5
  • 5
    • 51549102440 scopus 로고    scopus 로고
    • C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Größer. Almost-sure model checking of infinite paths in one-clock timed automata. Research Report LSV-08-13, Laboratoire Specification et Vérification, ENS Cachan, France, 2008.
    • C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Größer. Almost-sure model checking of infinite paths in one-clock timed automata. Research Report LSV-08-13, Laboratoire Specification et Vérification, ENS Cachan, France, 2008.
  • 7
    • 0032048230 scopus 로고    scopus 로고
    • On the verification of qualitative properties of probabilistic processes under fairness constraints
    • C. Baier and M. Z. Kwiatkowska. On the verification of qualitative properties of probabilistic processes under fairness constraints. Information Processing Letters, 66(2):71-79, 1998.
    • (1998) Information Processing Letters , vol.66 , Issue.2 , pp. 71-79
    • Baier, C.1    Kwiatkowska, M.Z.2
  • 8
    • 33745616497 scopus 로고    scopus 로고
    • Robust modelchecking of timed automata
    • Proc. 7th Latin American Symposium on Theoretical Informatics LATIN'06, of, Springer
    • P. Bouyer. N. Markey, and P.-A. Reynier. Robust modelchecking of timed automata. In Proc. 7th Latin American Symposium on Theoretical Informatics (LATIN'06), vol. 3887 of Lecture Notes in Computer Science, pp. 238-249. Springer, 2006.
    • (2006) Lecture Notes in Computer Science , vol.3887 , pp. 238-249
    • Bouyer, P.1    Markey, N.2    Reynier, P.-A.3
  • 9
    • 38149082173 scopus 로고    scopus 로고
    • Minimum-time reachability in timed games
    • Proc. 34th International Colloquium on Automata, Languages and Programming ICALP'07, of, Springer
    • T. Brihaye, T. A. Henzinger, V. Prabhu, and J.-F. Raskin. Minimum-time reachability in timed games. In Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP'07), vol. 4596 of Lecture Notes in Computer Science, pp. 825-837. Springer, 2007.
    • (2007) Lecture Notes in Computer Science , vol.4596 , pp. 825-837
    • Brihaye, T.1    Henzinger, T.A.2    Prabhu, V.3    Raskin, J.-F.4
  • 10
    • 84958173226 scopus 로고    scopus 로고
    • A comparison of control problems for timed and hybrid systems
    • Proc. 5th International Workshop on Hybrid Systems: Computation and Control HSCC'02, of, Springer
    • F. Cassez, T. A. Henzinger, and J.-F. Raskin. A comparison of control problems for timed and hybrid systems. In Proc. 5th International Workshop on Hybrid Systems: Computation and Control (HSCC'02), vol. 2289 of Lecture Notes in Computer Science, pp. 134-148. Springer, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2289 , pp. 134-148
    • Cassez, F.1    Henzinger, T.A.2    Raskin, J.-F.3
  • 11
    • 9444288765 scopus 로고    scopus 로고
    • An optimal automata approach to LTL model checking of probabilistic systems
    • Proc. 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning LPAR '03, of, Springer
    • J.-M. Couvreur, N. Saheb, and G. Sutre. An optimal automata approach to LTL model checking of probabilistic systems. In Proc. 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '03), vol. 2850 of Lecture Notes in Computer Science, pp. 361-375. Springer, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2850 , pp. 361-375
    • Couvreur, J.-M.1    Saheb, N.2    Sutre, G.3
  • 12
    • 35248841407 scopus 로고    scopus 로고
    • The element of surprise in timed games
    • Proc. 14th International Conference on Concurrency Theory CONCUR'03, of, Springer
    • L. de Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga. The element of surprise in timed games. In Proc. 14th International Conference on Concurrency Theory (CONCUR'03), vol. 2761 of Lecture Notes in Computer Science, pp. 142-156. Springer, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2761 , pp. 142-156
    • de Alfaro, L.1    Faella, M.2    Henzinger, T.A.3    Majumdar, R.4    Stoelinga, M.5
  • 13
    • 33750362521 scopus 로고    scopus 로고
    • Robustness and implementability of timed automata
    • Proc. Joint Conference on Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System FORMATS+FTRTFT'04, of, Springer
    • M. De Wulf, L. Doyen, N. Markey, and J.-F. Raskin. Robustness and implementability of timed automata. In Proc. Joint Conference on Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FORMATS+FTRTFT'04), vol. 3253 of Lecture Notes in Computer Science, pp. 118-133. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3253 , pp. 118-133
    • De Wulf, M.1    Doyen, L.2    Markey, N.3    Raskin, J.-F.4
  • 14
    • 35048849100 scopus 로고    scopus 로고
    • Almost ASAP semantics: From timed models to timed implementations
    • Proc. 7th International Workshop on Hybrid Systems: Computation and Control HSCC'04, of, Springer
    • M. De Wulf, L. Doyen, and J.-F. Raskin. Almost ASAP semantics: From timed models to timed implementations. In Proc. 7th International Workshop on Hybrid Systems: Computation and Control (HSCC'04), vol. 2993 of Lecture Notes in Computer Science, pp. 296-310. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.2993 , pp. 296-310
    • De Wulf, M.1    Doyen, L.2    Raskin, J.-F.3
  • 15
    • 0037544463 scopus 로고    scopus 로고
    • Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes
    • J. Desharnais and P. Panangaden. Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. Journal of Logic and Algebraic Programming, 56:99-115,2003.
    • (2003) Journal of Logic and Algebraic Programming , vol.56 , pp. 99-115
    • Desharnais, J.1    Panangaden, P.2
  • 16
    • 84957627066 scopus 로고    scopus 로고
    • Robust timed automata
    • Proc. International Workshop on Hybrid and Real-Time Systems HART'97, of, Springer
    • V. Gupta, T. A. Henzinger, and R. Jagadeesan. Robust timed automata. In Proc. International Workshop on Hybrid and Real-Time Systems (HART'97), vol. 1201 of Lecture Notes in Computer Science, pp. 331-345. Springer, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1201 , pp. 331-345
    • Gupta, V.1    Henzinger, T.A.2    Jagadeesan, R.3
  • 17
    • 84974712825 scopus 로고    scopus 로고
    • Robust undecidability of timed and hybrid systems
    • Proc. 3rd International Workshop on Hybrid Systems: Computation and Control HSCC'00, of, Springer
    • T. A. Henzinger and J.-F. Raskin. Robust undecidability of timed and hybrid systems. In Proc. 3rd International Workshop on Hybrid Systems: Computation and Control (HSCC'00), vol. 1790 of Lecture Notes in Computer Science, pp. 145-159. Springer, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1790 , pp. 145-159
    • Henzinger, T.A.1    Raskin, J.-F.2
  • 18
    • 33244476377 scopus 로고    scopus 로고
    • Model checking timed automata with one or two clocks
    • Proc. 15th International Conference on Concurrency Theory CONCUR'04, of, Springer
    • F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model checking timed automata with one or two clocks. In Proc. 15th International Conference on Concurrency Theory (CONCUR'04), vol. 3170 of Lecture Notes in Computer Science, pp. 387-401. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3170 , pp. 387-401
    • Laroussinie, F.1    Markey, N.2    Schnoebelen, P.3
  • 19
    • 0003391818 scopus 로고    scopus 로고
    • Prentice Hall, 2nd edition
    • J. R. Munkres. Topology. Prentice Hall, 2nd edition, 2000.
    • (2000) Topology
    • Munkres, J.R.1
  • 20
    • 33646025661 scopus 로고
    • The Banach-Mazur game and Banach category theorem
    • Contributions to the Theory of Games, 3
    • J. C. Oxtoby. The Banach-Mazur game and Banach category theorem. Annals of Mathematical Studies, 39:159-163, 1957. Contributions to the Theory of Games, volume 3.
    • (1957) Annals of Mathematical Studies , vol.39 , pp. 159-163
    • Oxtoby, J.C.1
  • 24
    • 0002859997 scopus 로고
    • Processes with probabilities, priority and time
    • C. Tofts. Processes with probabilities, priority and time. Formal Aspects of Computing, 6(5):536-564, 1994.
    • (1994) Formal Aspects of Computing , vol.6 , Issue.5 , pp. 536-564
    • Tofts, C.1
  • 26
    • 0022181923 scopus 로고
    • Automatic verification of probabilistic concurrent finite-state programs
    • IEEE Computer Society Press
    • M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th Symposium on Foundations of Computer Science (FOCS'85), pp. 327-338. IEEE Computer Society Press, 1985.
    • (1985) Proc. 26th Symposium on Foundations of Computer Science (FOCS'85) , pp. 327-338
    • Vardi, M.1


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