On probabilistic timed automata-Reference-Cited by-同舟云学术

On probabilistic timed automata

Published:2003-01 Issue:1 Volume:292 Page:65-84
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Beauquier Danièle

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. Verifying automata specifications of probabilistic real-time systems;Alur,1992

2. A theory of timed automata;Alur;Theoret. Comput. Sci.,1994

3. Rational ω-languages are non-ambiguous;Arnold;Theoret. Comput. Sci.,1983

4. Model checking of probabilistic and nondeterministic systems;Bianco,1995

5. D. Beauquier, Probabilistic ω-rational events, Technical Report 00-, Université Paris-12, Laboratoire d'Algorithmique, Complexité et Logique, 2000. 9 p., Fundamenta Informaticae 2001, 9pp, submitted for publication.

Cited by 60 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formal performance analysis of optimal relays-based protection scheme for automated distribution networks;Engineering Science and Technology, an International Journal;2024-03

2. A framework for modeling human behavior in large-scale agent-based epidemic simulations;SIMULATION;2023-08-08

3. Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice;ACM Computing Surveys;2022-12-07

4. An agent-based model of the dual causality between individual and collective behaviors in an epidemic;Computers in Biology and Medicine;2022-02

5. Probabilistic Model Checking and Autonomy;Annual Review of Control, Robotics, and Autonomous Systems;2021-12-06