Event-Clock Visibly Pushdown Automata
From MaRDI portal
Recommendations
- Event-clock automata: a determinizable class of timed automata
- Event-clock nested automata
- On the determinization of event-clock input-driven pushdown automata
- Event clock automata: from theory to practice
- A Logical Characterisation of Event Clock Automata
- Kleene theorems for event-clock automata
- Visibly pushdown automata and transducers with counters
- Timed Pushdown Automata Revisited
- Past pushdown timed automata
Cites work
- A Logical Characterisation of Event Clock Automata
- A theory of timed automata
- Decidability and complexity results for timed automata via channel machines
- Event-clock automata: a determinizable class of timed automata
- Hybrid Systems: Computation and Control
- Model Checking One-clock Priced Timed Automata
- On timed automata with input-determined guards
- Visibly pushdown languages
- Well-structured transition systems everywhere!
Cited in
(15)- Event-clock automata: a determinizable class of timed automata
- Event-clock nested automata
- On the determinization of event-clock input-driven pushdown automata
- Context-free timed formalisms: robust automata and linear temporal logics
- Reachability relations of timed pushdown automata
- A logical characterization for dense-time visibly pushdown automata
- A perfect class of context-sensitive timed languages
- Event clock automata: from theory to practice
- Timed context-free temporal logics
- A survey of timed automata for the development of real-time systems
- On regions and zones for event-clock automata
- Kleene theorems for event-clock automata
- Exact descriptional complexity of determinization of input-driven pushdown automata
- Probabilistic input-driven pushdown automata
- Exact descriptional complexity of determinization of input-driven pushdown automata
This page was built for publication: Event-Clock Visibly Pushdown Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599103)