The following pages link to David N. Jansen (Q896907):
Displaying 25 items.
- Multiphase until formulas over Markov reward models: an algebraic approach (Q896909) (← links)
- The axiomatization of override and update (Q975885) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- Distribution-based bisimulation for labelled Markov processes (Q1683448) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
- (Q2772436) (← links)
- Minimal Separating Sequences for All Pairs of States (Q2798719) (← links)
- More or Less True DCTL for Continuous-Time MDPs (Q2842666) (← links)
- Efficient CSL model checking using stratification (Q2904612) (← links)
- On Abstraction of Probabilistic Systems (Q2937733) (← links)
- Automata-Based CSL Model Checking (Q3012926) (← links)
- Extending CTL with Actions and Real Time (Q3146303) (← links)
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations (Q3623003) (← links)
- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata (Q3630197) (← links)
- An Automatic Proving Approach to Parameterized Verification (Q4617972) (← links)
- On Equivalence Checking of Nondeterministic Finite Automata (Q5045387) (← links)
- (Q5089272) (← links)
- Finding Polynomial Loop Invariants for Probabilistic Programs (Q5096098) (← links)
- (Q5101352) (← links)
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems (Q5164166) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- A Probabilistic Extension of UML Statecharts (Q5392299) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479151) (← links)
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking (Q5758103) (← links)
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations (Q5758107) (← links)
