On termination and boundedness of nested updatable timed automata

DOI10.1007/978-3-319-57708-1_2zbMATH Open1461.68108OpenAlexW2605667388MaRDI QIDQ4989016FDOQ4989016

Authors: Yuwei Wang, Xiuting Tao, Guoqiang Li 

Publication date: 20 May 2021

Published in: Structured Object-Oriented Formal Language and Method (Search for Journal in Brave)

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

Recommendations

• Nested timed automata
• Updatable timed automata
• Nested timed automata with frozen clocks
• scientific article; zbMATH DE number 1759410
• On reachability analysis of updatable timed automata with one updatable clock

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Title not available (Why is that?)
• Nested timed automata with frozen clocks
• Nested timed automata
• Nested Timed Automata with Invariants

This page was built for publication: On termination and boundedness of nested updatable timed automata

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