Removing All Silent Transitions from Timed Automata
From MaRDI portal
Publication:3648827
DOI10.1007/978-3-642-04368-0_11zbMath1262.68089MaRDI QIDQ3648827
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
68Q45: Formal languages and automata
Related Items
Equivalence checking and intersection of deterministic timed finite state machines, A survey of timed automata for the development of real-time systems, Removing All Silent Transitions from Timed Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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