The following pages link to Vojtěch Řehák (Q1006889):
Displayed 18 items.
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Petri nets are less expressive than state-extended PA (Q2481981) (← links)
- (Q2847415) (← links)
- (Q2852014) (← links)
- Almost linear Büchi automata (Q2883118) (← links)
- LTL to Büchi Automata Translation: Fast and More Deterministic (Q2894268) (← links)
- Verification of Open Interactive Markov Chains (Q2957522) (← links)
- Measuring performance of continuous-time stochastic processes using timed automata (Q2986711) (← links)
- Fixed-Delay Events in Generalized Semi-Markov Processes Revisited (Q3090827) (← links)
- Stochastic Real-Time Games with Qualitative Timed Automata Objectives (Q3584931) (← links)
- Synthesis of Optimal Resilient Control Strategies (Q5096100) (← links)
- (Q5146593) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms (Q5194930) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311485) (← links)
- On Decidability of LTL Model Checking for Process Rewrite Systems (Q5385990) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897771) (← links)