Pages that link to "Item:Q1858436"
From MaRDI portal
The following pages link to Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436):
Displayed 9 items.
- Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← links)
- When are timed automata weakly timed bisimilar to time Petri nets? (Q944375) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- On the expressivity and complexity of quantitative branching-time temporal logics (Q1401306) (← links)
- Timed network games (Q2112796) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- The tail-recursive fragment of timed recursive CTL (Q6077845) (← links)