Optimal Conditional Reachability for Multi-priced Timed Automata

@inproceedings{Larsen2005OptimalCR,
  title={Optimal Conditional Reachability for Multi-priced Timed Automata},
  author={Kim G. Larsen and Jacob Illum Rasmussen},
  booktitle={FoSSaCS},
  year={2005}
}
  • Kim G. Larsen, Jacob Illum Rasmussen
  • Published in FoSSaCS 2005
  • Computer Science
  • In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for each location. More precisely, we consider the problem of determining the minimal cost of reaching a given target state, with respect to some primary cost variable, while respecting upper bound constraints on the remaining (secondary) cost variables. Decidability is proven by… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 32 CITATIONS

    Extending EAST-ADL for Modeling and Analysis of System's Resource-Usage

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    A Theory of Duration Calculus with Application

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Deciding an Interval Logic with Accumulated Durations

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Multi-weighted Automata and MSO Logic

    VIEW 6 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Multi-weighted Automata Models and Quantitative Logics

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    REMES: A Resource Model for Embedded Systems

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Guided Design of Attack Trees: A System-Based Approach

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Model Checking Real-Time Systems

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 13 REFERENCES

    Algorithms for the Multi-constrained Routing Problem

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Optimal paths in weighted timed automata

    VIEW 2 EXCERPTS

    Better is better than well: on efficient verification of infinite-state systems

    • P.A. Abdulla, Aletta Nylén
    • Computer Science
    • Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
    • 2000
    VIEW 1 EXCERPT

    Henzinger , and Pei - Hsin Ho . Hybrid automata : An algorithmic approach to the specification and verification of hybrid systems

    • Costas Courcoubetis
    • Proceedings of the 15 th Annual IEEE Symposium on Logic in Computer Science
    • 2000

    HYTECH: a model checker for hybrid systems

    VIEW 2 EXCERPTS

    Uppaal in a nutshell

    VIEW 2 EXCERPTS