Nested timed automata with frozen clocks

DOI10.1007/978-3-319-22975-1_13zbMATH Open1465.68160OpenAlexW2185756575MaRDI QIDQ2945595FDOQ2945595

Authors: Mizuhito Ogawa, Shoji Yuen, Guoqiang Li 

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22975-1_13

Recommendations

• Nested timed automata
• Nested Timed Automata with Invariants
• On termination and boundedness of nested updatable timed automata
• Reachability relations of timed pushdown automata
• Recursive timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• What's decidable about hybrid automata?
• Nested timed automata
• Dense-timed pushdown automata
• Title not available (Why is that?)
• Recursive timed automata
• Symbolic model checking for real-time systems
• Model checking of systems with many identical timed processes
• Well-structured pushdown systems
• Well-structured pushdown system: case of dense timed pushdown automata
• What's decidable about recursive hybrid automata?
• Hyper-Ackermannian bounds for pushdown vector addition systems

Cited In (3)

• On termination and boundedness of nested updatable timed automata
• Nested timed automata
• Nested Timed Automata with Invariants

This page was built for publication: Nested timed automata with frozen clocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945595)