Reachability in timed automata with diagonal constraints

  title={Reachability in timed automata with diagonal constraints},
  author={P. Gastin and Sayan Mukherjee and B. Srivathsan},
  • P. Gastin, Sayan Mukherjee, B. Srivathsan
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • We consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enumerating reachable sets of its configurations, stored in the form of a data structure called "zones". Simulation relations between zones are essential to ensure termination and efficiency. The algorithm employs a simulation test "is-Z-simulated-by-Z' ?" which ascertains that zone Z does not reach more states than zone… CONTINUE READING
    7 Citations
    Revisiting timed logics with automata modalities
    • 1
    • PDF
    Parametric Scheduler Characterization
    Optimization of product flows in flexible manufacturing systems
    • 1
    • PDF


    Lazy abstractions for timed automata
    • 22
    • PDF
    Better Abstractions for Timed Automata
    • 27
    • PDF
    Forward Analysis of Updatable Timed Automata
    • P. Bouyer
    • Computer Science
    • Formal Methods Syst. Des.
    • 2004
    • 114
    • PDF
    A Theory of Timed Automata
    • 6,818
    • PDF
    Lower and upper bounds in zone-based abstractions of timed automata
    • 80
    • PDF