The following pages link to (Q4251913):
Displaying 15 items.
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Iterating transducers (Q1858440) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- Cryptographic Analysis in Cubic Time (Q2841271) (← links)
- (Q2842873) (← links)
- On Symbolic Verification of Weakly Extended PAD (Q2866343) (← links)
- Efficiency of automata in semi-commutation verification techniques (Q3515458) (← links)
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems (Q3541030) (← links)
- Verifying Parallel Programs with Dynamic Communication Structures (Q3637351) (← links)
- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order (Q3646258) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
