L. de Alfaro, T. A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Proc. 12th Int. Conf. Concurrency Theory (CONCUR 2001), Aalborg, Denmark, Aug. 2001, volume 2154 of Lecture Notes in Computer Science, pages 536--550. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Comparison of Control Problems for Timed and Hybrid Systems - Cassez, Henzinger, Raskin (2002) (2 citations) Self-citation (Henzinger) (Correct)
No context found.
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In CONCUR: Concurrency Theory, LNCS 2154, pp. 536--550. Springer, 2001.
Timed Interfaces - de Alfaro, Henzinger, Stoelinga (2002) (1 citation) Self-citation (De alfaro Henzinger) (Correct)
No context found.
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Concurrency Theory, volume 2154 of Lect. Notes in Comp. Sci., pages 536--550. Springer, 2001.
The Element of Surprise in Timed Games - de Alfaro, Faella, Henzinger.. Self-citation (De alfaro Henzinger Majumdar) (Correct)
No context found.
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Concurrency Theory, Lect. Notes in Comp. Sci. 2154, pages 536--550. Springer, 2001.
Counterexample-guided Control - Henzinger, Jhala, Majumdar (2003) (2 citations) Self-citation (Henzinger Majumdar) (Correct)
No context found.
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In CONCUR: Concurrency Theory, pages 536--550. LNCS 2154, Springer, 2001.
On Computing Fixpoints in Well-Structured Regular Model.. - Baier Bertrand And (Correct)
No context found.
L. de Alfaro, T. A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Proc. 12th Int. Conf. Concurrency Theory (CONCUR 2001), Aalborg, Denmark, Aug. 2001, volume 2154 of Lecture Notes in Computer Science, pages 536--550. Springer, 2001.
Synthesis of Optimal Strategies Using HYTECH - Bouyer, Cassez, Fleury, Larsen (2004) (1 citation) (Correct)
No context found.
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Proc. 12th International Conference on Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in Computer Science, pages 536--550. Springer, 2001.
Petri Games are Monotone but Difficult to Decide - Raskin, al. (2003) (Correct)
No context found.
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In CONCUR 01: Concurrency Theory, Lecture Notes in Computer Science 2154, pages 536--550. Springer-Verlag, 2001.
Petri Games are Monotonic but Difficult to Decide - Raskin, Samuelides, Van Begin (2003) (1 citation) (Correct)
No context found.
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In CONCUR 01: Concurrency Theory, Lecture Notes in Computer Science 2154, pages 536--550. Springer-Verlag, 2001.
Optimal Strategies in Priced Timed Game Automata - Bouyer, Cassez, Fleury, Larsen (2004) (1 citation) (Correct)
No context found.
Luca De Alfaro, Thomas A. Henzinger, and Rupak Majumdar. Symbolic algorithms for infinite-state games. In Proc. 12th International Conference on Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in Computer Science, pages 536--550. Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC