scientific article
From MaRDI portal
Publication:3384894
Publication date: 17 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF18.17
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (5)
Model-checking structured context-free languages ⋮ Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Context-free timed formalisms: robust automata and linear temporal logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Timed recursive state machines: expressiveness and complexity
- Real-time logics: Complexity and expressiveness
- Pushdown module checking
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- Event-clock nested automata
- A Logical Characterization for Dense-Time Visibly Pushdown Automata
- Dense-Timed Pushdown Automata
- Visibly pushdown languages
- Event-Clock Visibly Pushdown Automata
- The benefits of relaxing punctuality
- Timed Pushdown Automata Revisited
- Recursive Timed Automata
- Tools and Algorithms for the Construction and Analysis of Systems
- On the decidability and complexity of Metric Temporal Logic over finite words
- Hybrid Systems: Computation and Control
- Foundations of Software Science and Computation Structures
This page was built for publication:
