An efficient algorithm for minimizing real-time transition systems-Reference-Cited by-同舟云学术

An efficient algorithm for minimizing real-time transition systems

Published:1993 Issue: Volume: Page:210-224
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Yannakakis Mihalis,Lee David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56922-7_18

Reference25 articles.

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-timed systems. In Proc. of the 5th IEEE Symp. on Logic in Computer Science, pp. 414–425, 1990.

2. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. of Real-Time Systems Symp., pp. 157–166, 1992.

3. R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of timed transition systems. In Proc. of CONCUR'92, Springer-Verlag LNCS 630, pp. 341–354, 1992.

4. R. Alur, and D. Dill. Automata for modeling real-time systems. In Proc. of the 17th Intl. Colloq. on Automata, Languages and Programming, Springer-Verlag LNCS 443, pp. 322–335, 1990.

5. R. Alur, and T. Henzinger. A really temporal logic. In Proc. of the 30th IEEE Symp. on Foundations of Computer Science, pp. 164–169, 1989.

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

1. A Symbolic Algorithm for the Analysis of Robust Timed Automata;Lecture Notes in Computer Science;2014

2. Timed Model-Checking;Communicating Embedded Systems;2013-02-13

3. SetExp: a method of transformation of timed automata into finite state automata;Real-Time Systems;2010-08-03

4. A New Method for Transforming Timed Automata;Electronic Notes in Theoretical Computer Science;2005-05

5. Timed Automata: Semantics, Algorithms and Tools;Lectures on Concurrency and Petri Nets;2004