The following pages link to Piotr Hofman (Q2254492):
Displayed 30 items.
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- Continuous reachability for unordered data Petri nets is in PTime (Q2289079) (← links)
- Trace inclusion for one-counter nets revisited (Q2636512) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- Simulation Problems Over One-Counter Nets (Q2800968) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Shortest Paths in One-Counter Systems (Q2811358) (← links)
- Simulation Over One-counter Nets is PSPACE-Complete (Q2963939) (← links)
- Relating timed and register automata (Q2971073) (← links)
- Bounding Average-Energy Games (Q2988367) (← links)
- Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854) (← links)
- Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
- (Q3536769) (← links)
- (Q4601893) (← links)
- Infinite-state energy games (Q4635588) (← links)
- The complexity of regular abstractions of one-counter languages (Q4635876) (← links)
- (Q4636612) (← links)
- (Q4963999) (← links)
- (Q4986262) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- (Q5009439) (← links)
- Linear equations for unordered data vectors in $[D]^k\to{}Z^d$ (Q5060183) (← links)
- Universality Problem for Unambiguous VASS (Q5089303) (← links)
- (Q5089314) (← links)
- (Q5144611) (← links)
- Decidability of Weak Simulation on One-Counter Nets (Q5271057) (← links)
- (Q5738937) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)
- Reachability Problem for Weak Multi-Pushdown Automata (Q5891173) (← links)
- Reachability Problem for Weak Multi-Pushdown Automata (Q5891773) (← links)