Pages that link to "Item:Q5466471"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466471):
Displaying 16 items.
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Theory of interaction (Q896903) (← links)
- On the expressiveness of interaction (Q960859) (← 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)
- Spatial and behavioral types in the pi-calculus (Q1959478) (← links)
- A Petri Net Interpretation of Open Reconfigurable Systems (Q3011889) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← 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)
- (Q4449170) (← links)
- (Q5009453) (← links)
- Foundations of Software Science and Computation Structures (Q5308453) (← links)