See this document in CiteSeerX!

Optimal-Reachability and Control for Acyclic Weighted Timed Automata (2002)  (Make Corrections)  (3 citations)
Salvatore La Torre, Supratik Mukhopadhyay, Aniello Murano



  Home/Search   Context   Related

 
View or download:
dia.unisa.it/dotto..._timed_automata.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  people.na.infn.it...pubblicazioni (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Weighted timed automata extend timed automata with costs on both locations and transitions. In this framework we study the optimal reachability and the optimal control synthesis problems for the automata with acyclic control graphs. This class of automata is relevant for some practical problems such as some static scheduling problems or air-trac control problems. We give a nondeterministic polynomial time algorithm to solve the decision version of the considered optimal reachability problem.... (Update)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

Salvatore La Torre, Supratik Mukhopadhyay, and Aniello Murano. Optimal-reachability and control for acyclic weighted timed automata. In Proc. 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), volume 223 of IFIP Conference Proceedings, pages 485--497. Kluwer, 2002. http://citeseer.ist.psu.edu/736854.html   More

@misc{ torre02optimalreachability,
  author = "S. Torre and S. Mukhopadhyay and A. Murano",
  title = "Optimal-reachability and control for acyclic weighted timed automata",
  text = "Salvatore La Torre, Supratik Mukhopadhyay, and Aniello Murano. Optimal-reachability
    and control for acyclic weighted timed automata. In Proc. 2nd IFIP International
    Conference on Theoretical Computer Science (TCS 2002), volume 223 of IFIP
    Conference Proceedings, pages 485--497. Kluwer, 2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/736854.html" }
Citations (may not include all citations):
666   Theoretical Computer Science (context) - Alur, Dill et al. - 1994
103   the synthesis of discrete controllers for timed systems (context) - Maler, Pnueli et al. - 1995
70   Symbolic controller synthesis for discrete and timed systems - Asarin, Maler et al. - 1995
50   Minimum and maximum delay problems in real-time systems (context) - Courcoubetis, Yannakakis - 1991
36   Computing accumulated delays in real-time system - Alur, Courcoubetis et al. - 1993
29   As soon as possible: Time optimal control for timed automata - Asarin, Maler - 1999
28   Discrete-time control for rectangular hybrid automata - Henzinger, Kopke - 1999
22   Rectangular hybrid games - Henzinger, Horowitz et al. - 1999
21   Minimum-time reachability for timed automata - Niebert, Tripakis et al. - 2000
17   Optimal paths in weighted timed automata - Alur, Torre et al. - 2034
14   As cheap as possible: Ecient cost-optimal reachability for p.. - Larsen, Behrman et al. - 2001
8   Job-shop scheduling using timed automata (context) - Abdedaim, Maler - 2001
7   Dense Real-time Games - Faella, Torre et al. - 2002
5   Automata-theoretic decision of timed games - Faella, Torre et al. - 2002
4   A decision procedure for the rst order theory on real additi.. (context) - Ferrante, Racko - 1975

[Article contains additional citations not shown here]

Documents on the same site (http://people.na.infn.it/~murano/pubblicazioni.html):   More
Automata-theoretic Decision of Timed Games - Marco Faella Salvatore (2002)   (Correct)
Typeness for ω-Regular Automata - Kupferman, Morgenstern, Murano (2004)   (Correct)
Reasoning about Co-Büchi Tree Automata - Torre, Murano (2005)   (Correct)

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