An efficient customized clock allocation algorithm for a class of timed automata

DOI10.1007/978-3-031-22476-8_1zbMath1528.68200OpenAlexW4312534358MaRDI QIDQ6113895

Feliks Kluźniak, Neda Saeedloei

Publication date: 10 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-22476-8_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• 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?
• A fast algorithm for finding dominators in a flowgraph
• Clock Allocation in Timed Automata and Graph Colouring
• From Scenarios to Timed Automata
• Programming Languages and Systems
• Formal Methods for the Design of Real-Time Systems
• Automata, Languages and Programming

This page was built for publication: An efficient customized clock allocation algorithm for a class of timed automata