The following pages link to (Q4247290):
Displayed 16 items.
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States (Q5089288) (← links)
- (Q5089315) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
- Interleaving vs True Concurrency: Some Instructive Security Examples (Q5100754) (← links)
- PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets (Q5100757) (← links)
- (Q5155662) (← links)
- (Q5856425) (← links)
- Partial order reduction for reachability games (Q5875384) (← links)
- Long-Run Average Behavior of Vector Addition Systems with States (Q5875389) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings (Q5900141) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- Inheritance of behavior (Q5943265) (← links)
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (Q6137873) (← links)
- Parameterized Analysis of Immediate Observation Petri Nets (Q6144223) (← links)
- Waiting Nets: State Classes and Taxonomy (Q6189319) (← links)