Untangling the graphs of timed automata to decrease the number of clocks

DOI10.1007/978-3-031-07727-2_10zbMath1502.68167OpenAlexW4285291534MaRDI QIDQ2165509

Neda Saeedloei, Feliks Kluźniak

Publication date: 19 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07727-2_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Reducing Clocks in Timed Automata while Preserving Bisimulation
• Undecidable Problems About Timed Automata
• When Are Timed Automata Determinizable?
• Clock Allocation in Timed Automata and Graph Colouring
• Formal Methods for the Design of Real-Time Systems
• Automata, Languages and Programming

This page was built for publication: Untangling the graphs of timed automata to decrease the number of clocks