Minimization of the number of clocks for timed scenarios

DOI10.1007/978-3-030-92137-8_8zbMath1498.68141OpenAlexW3217397584MaRDI QIDQ2154053

Feliks Kluźniak, Neda Saeedloei

Publication date: 13 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92137-8_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A theory of timed automata
• Optimization of timed scenarios
• Matching Scenarios with Timing Constraints
• Checking Coverage for Infinite Collections of Timed Scenarios
• When Are Timed Automata Determinizable?
• Clock Allocation in Timed Automata and Graph Colouring
• From Scenarios to Timed Automata
• Formal Methods for the Design of Real-Time Systems
• Formal Methods in Software and Systems Modeling
• Automata, Languages and Programming
• Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning

This page was built for publication: Minimization of the number of clocks for timed scenarios