The following pages link to CONCUR 2004 - Concurrency Theory (Q5311488):
Displaying 14 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Bounded underapproximations (Q453533) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- (Q5089304) (← links)
- (Q5089314) (← links)
- (Q5089315) (← links)
- (Q5090970) (← links)
- Dimension-minimality and primality of counter nets (Q6629528) (← links)
- Lower bounds for the reachability problem in fixed dimensional VASSes (Q6649473) (← links)
