Pages that link to "Item:Q6162104"
From MaRDI portal
The following pages link to Verifying abstractions of timed systems (Q6162104):
Displaying 14 items.
- Better abstractions for timed automata (Q342707) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Modular abstractions for verifying real-time distributed systems (Q685095) (← links)
- A theory of implementation and refinement in timed Petri nets (Q1128980) (← links)
- Predicate abstraction for dense real-time systems (Q2842588) (← links)
- Timing in the cospan-span model (Q2847779) (← links)
- On Abstractions for Timing Analysis in the $\mathbb{K}$ Framework (Q3167528) (← links)
- (Q4003036) (← links)
- (Q4551149) (← links)
- Modularity for timed and hybrid systems (Q6044109) (← links)
- Learning assumptions for compositional verification of timed automata (Q6535626) (← links)
- Computing bisimilarity metrics for probabilistic timed automata (Q6536354) (← links)
- History-deterministic timed automata (Q6635511) (← links)