The following pages link to Jiří Srba (Q444489):
Displaying 50 items.
- (Q236790) (redirect page) (← links)
- Modal transition systems with weight intervals (Q444490) (← links)
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Stubborn set reduction for timed reachability and safety games (Q832029) (← links)
- On determinism in modal transition systems (Q843096) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Strong bisimilarity of simple process algebras: Complexity lower bounds (Q1424356) (← links)
- Stubborn versus structural reductions for Petri nets (Q1633343) (← links)
- Distributed computation of fixed points on dependency graphs (Q1660777) (← 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)
- Resilient capacity-aware routing (Q2044217) (← links)
- Automatic synthesis of transiently correct network updates via Petri games (Q2117163) (← links)
- Verification of multiplayer stochastic games via abstract dependency graphs (Q2119119) (← links)
- Faster pushdown reachability analysis with applications in network verification (Q2147193) (← links)
- Automata-driven partial order reduction and guided search for LTL model checking (Q2152647) (← links)
- Kaki: concurrent update synthesis for regular policies via Petri games (Q2165522) (← links)
- Simplification of CTL formulae for efficient model checking of Petri nets (Q2280185) (← links)
- Refinement checking on parametric modal transition systems (Q2340259) (← links)
- Model checking and synthesis for branching multi-weighted logics (Q2423760) (← links)
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata (Q2453531) (← links)
- Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics (Q2803579) (← links)
- Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization (Q2814624) (← links)
- (Q2847411) (← links)
- Dual-Priced Modal Transition Systems with Time Durations (Q2891444) (← links)
- TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets (Q2894293) (← links)
- Extending modal transition systems with structured labels (Q2909731) (← links)
- Verification of Timed-Arc Petri Nets (Q3075507) (← links)
- Energy Games in Multiweighted Automata (Q3105747) (← links)
- Parametric Modal Transition Systems (Q3172920) (← links)
- Synchronizing Strategies under Partial Observability (Q3190117) (← links)
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete (Q3393402) (← links)
- (Q3395948) (← links)
- Language Emptiness of Continuous-Time Parametric Timed Automata (Q3449466) (← links)
- Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols (Q3522925) (← links)
- Height-Deterministic Pushdown Automata (Q3525562) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- Infinite Runs in Weighted Timed Automata with Energy Constraints (Q3543286) (← links)
- Undecidability of bisimilarity by defender's forcing (Q3546360) (← links)
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (Q3613330) (← links)
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (Q3617746) (← links)
- Beyond Language Equivalence on Visibly Pushdown Automata (Q3623014) (← links)
- (Q4218112) (← links)
- (Q4412112) (← links)
- Complexity of weak bisimilarity and regularity for BPA and BPP (Q4461214) (← links)
- (Q4474226) (← links)
- (Q4484512) (← links)
- (Q4496248) (← links)