The following pages link to Kim Guldstrand Larsen (Q808272):
Displaying 50 items.
- (Q169907) (redirect page) (← links)
- Adequacy and complete axiomatization for timed modal logic (Q283762) (← links)
- Abstract probabilistic automata (Q386011) (← links)
- Robust synthesis for real-time systems (Q386617) (← links)
- Consistency and refinement for interval Markov chains (Q444461) (← links)
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- Modal transition systems with weight intervals (Q444490) (← links)
- Metrics for weighted transition systems: axiomatization and complexity (Q549202) (← links)
- Constraint Markov chains (Q554215) (← links)
- Scenario-based verification of real-time systems using UPPAAL (Q633291) (← links)
- Graphical versus logical specifications (Q685358) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- Verification of hierarchical state/Event systems using reusability and compositionality (Q698109) (← links)
- Quantitative analysis of weighted transition systems (Q710680) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- Stubborn set reduction for timed reachability and safety games (Q832029) (← links)
- An integer static analysis for better extrapolation in Uppaal (Q832038) (← links)
- Lumpability for uncertain continuous-time Markov chains (Q832091) (← links)
- On determinism in modal transition systems (Q843096) (← links)
- On using priced timed automata to achieve optimal scheduling (Q853729) (← links)
- Concurrent weighted logic (Q890620) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- Recursively defined domains and their induction principles (Q1098615) (← links)
- Bisimulation through probabilistic testing (Q1175940) (← links)
- Partial specifications and compositional verification (Q1177172) (← links)
- A compositional protocol verification using relativized bisimulation (Q1193593) (← links)
- Time-abstracted bisimulation: Implicit specifications and decidability (Q1363777) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- Compact data structures and state-space reduction for model-checking real-time systems (Q1431366) (← links)
- (Q1630036) (redirect page) (← links)
- Memory-efficient tactics for randomized LTL model checking (Q1630037) (← links)
- Weighted branching systems: behavioural equivalence, behavioural distance, and their logical characterisations (Q1631225) (← links)
- Timed comparisons of semi-Markov processes (Q1647713) (← links)
- Importance sampling for stochastic timed automata (Q1660773) (← links)
- Distributed computation of fixed points on dependency graphs (Q1660777) (← links)
- A complete approximation theory for weighted transition systems (Q1660779) (← links)
- Extended dependency graphs and efficient distributed fixed-point computation (Q1662534) (← links)
- PTrie: data structure for compressing and storing sets via prefix sharing (Q1675812) (← links)
- Symbolic dependency graphs for \(\mathrm {PCTL}^{>}_{\leq}\) model-checking (Q1683447) (← links)
- Refinement of trace abstraction for real-time programs (Q1685776) (← links)
- Learning deterministic probabilistic automata from a model checking perspective (Q1689574) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- On decidability of recursive weighted logics (Q1797779) (← links)
- Uppaal in a nutshell (Q1856195) (← links)
- Automated verification of an audio-control protocol using UPPAAL (Q1858445) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty (Q2024347) (← links)
