Removing All Silent Transitions from Timed Automata

DOI10.1007/978-3-642-04368-0_11zbMath1262.68089OpenAlexW1579065239MaRDI QIDQ3648827

Catalin Dima, Ruggero Lanotte

Publication date: 1 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

A survey of timed automata for the development of real-time systems ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ Removing All Silent Transitions from Timed Automata

Cites Work

• Functional equations in the theory of dynamic programming. III
• A theory of timed automata
• Undecidability Results for Timed Automata with Silent Transitions
• Volume and Entropy of Regular Timed Languages: Analytic Approach
• Removing All Silent Transitions from Timed Automata
• Verification of Timed Automata via Satisfiability Checking
• Formal Modeling and Analysis of Timed Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Removing All Silent Transitions from Timed Automata