The following pages link to Thomas A. Henzinger (Q355505):
Displaying 50 items.
- (Q202463) (redirect page) (← links)
- Strategy improvement for concurrent reachability and turn-based stochastic safety games (Q355506) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Lumpability abstractions of rule-based systems (Q418843) (← links)
- Verification of STM on relaxed memory models (Q453508) (← links)
- Interface simulation distances (Q477211) (← links)
- Quantitative fair simulation games (Q528184) (← links)
- Approximation of event probabilities in noisy cellular processes (Q533357) (← links)
- The algorithmic analysis of hybrid systems (Q673868) (← links)
- Real-time logics: Complexity and expressiveness (Q689093) (← links)
- Stack size analysis for interrupt-driven programs (Q703848) (← links)
- Simulation distances (Q764284) (← links)
- Games with secure equilibria (Q854165) (← links)
- Randomness for free (Q897644) (← links)
- Stochastic limit-average games are in EXPTIME (Q933752) (← links)
- Reduction of stochastic parity to stochastic mean-payoff games (Q963321) (← links)
- Strategy logic (Q979080) (← links)
- Sooner is safer than later (Q1199553) (← links)
- What's decidable about hybrid automata? (Q1273866) (← links)
- Event-clock automata: a determinizable class of timed automata (Q1274452) (← links)
- Symbolic model checking for real-time systems (Q1327398) (← links)
- Temporal proof methodologies for timed transition systems (Q1333273) (← links)
- Monitoring temporal logic with clock variables (Q1631217) (← links)
- Quantitative monitor automata (Q1664379) (← links)
- Conic abstractions for hybrid systems (Q1683444) (← links)
- Model checking the evolution of gene regulatory networks (Q1683930) (← links)
- Fair simulation (Q1854506) (← links)
- Real-time system = discrete system + clock variables (Q1856191) (← links)
- HyTech: A model checker for hybrid systems (Q1856193) (← links)
- From pre-historic to post-modern symbolic model checking (Q1878908) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← links)
- Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
- Flavors of sequential information flow (Q2152640) (← links)
- Infinite-duration poorman-bidding games (Q2190378) (← links)
- Refinement for structured concurrent programs (Q2225107) (← links)
- Long lived transients in gene regulation (Q2238202) (← links)
- A survey of partial-observation stochastic parity games (Q2248075) (← links)
- Synthesizing robust systems (Q2249662) (← links)
- Faster statistical model checking for unbounded temporal properties (Q2272915) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- Transient memory in gene regulation (Q2326590) (← links)
- Bidding games on Markov decision processes (Q2330584) (← links)
- The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Model measuring for discrete and hybrid systems (Q2374564) (← links)
- Model checking transactional memories (Q2377134) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Model checking discounted temporal properties (Q2575738) (← links)
- Bidding mechanisms in graph games (Q2662675) (← links)
- (Q2703739) (← links)
