The following pages link to Ranko Lazić (Q407524):
Displaying 49 items.
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- What makes Petri nets harder to verify: stack or data? (Q1708715) (← links)
- The covering and boundedness problems for branching vector addition systems (Q1936244) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- Contextual Approximation and Higher-Order Procedures (Q2811338) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- (Q2848417) (← links)
- Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian (Q2849950) (← links)
- (Q2851060) (← links)
- (Q2851065) (← links)
- (Q2920125) (← links)
- LTL with the freeze quantifier and register automata (Q2946574) (← links)
- Safety alternating automata on data words (Q2946627) (← links)
- Alternating automata on data trees and XPath satisfiability (Q2946637) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time (Q3449481) (← links)
- Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (Q3543289) (← links)
- Average-Price-per-Reward Games on Hybrid Automata with Strong Resets (Q3600473) (← links)
- (Q3601861) (← links)
- Nets with Tokens Which Carry Data (Q3612940) (← links)
- (Q4457460) (← links)
- (Q4536630) (← links)
- A polynomial-time algorithm for reachability in branching VASS in dimension one (Q4598246) (← links)
- The Complexity of Coverability in ν-Petri Nets (Q4635904) (← links)
- Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete (Q4635905) (← links)
- Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems (Q4972152) (← links)
- (Q5002806) (← links)
- The Reachability Problem for Petri Nets Is Not Elementary (Q5056399) (← links)
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States (Q5056423) (← links)
- (Q5089315) (← links)
- Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One (Q5111451) (← links)
- (Q5144629) (← links)
- (Q5144638) (← links)
- (Q5144652) (← links)
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games (Q5145306) (← links)
- The reachability problem for Petri nets is not elementary (Q5212744) (← links)
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games (Q5236329) (← links)
- Zeno, Hercules, and the Hydra (Q5277917) (← links)
- Safely Freezing LTL (Q5386001) (← links)
- Model Checking Freeze LTL over One-Counter Automata (Q5458381) (← links)
- Communicating Sequential Processes. The First 25 Years (Q5709375) (← links)
- (Q5875635) (← links)
- Static Analysis (Q5897431) (← links)
- The ideal view on Rackoff's coverability technique (Q5915733) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
