The following pages link to (Q4449170):
Displaying 14 items.
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Theory of interaction (Q896903) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- On the computational strength of pure ambient calculi (Q1763730) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence (Q3498448) (← links)
- On the Expressive Power of Restriction and Priorities in CCS with Replication (Q3617733) (← links)
- Foundations of Software Science and Computation Structures (Q5308453) (← links)
- Automata, Languages and Programming (Q5466471) (← links)
