The following pages link to CONCUR 2004 - Concurrency Theory (Q5311485):
Displaying 9 items.
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Petri nets are less expressive than state-extended PA (Q2481981) (← links)
- Tree regular model checking: a simulation-based approach (Q2500700) (← links)
- On Symbolic Verification of Weakly Extended PAD (Q2866343) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)
