Pages that link to "Item:Q1763730"
From MaRDI portal
The following pages link to On the computational strength of pure ambient calculi (Q1763730):
Displaying 17 items.
- Reachability problems in BioAmbients (Q418830) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- Fair ambients (Q877172) (← links)
- Theory of interaction (Q896903) (← links)
- Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- On the computational power of BlenX (Q1044845) (← links)
- Distributability of mobile ambients (Q2216122) (← links)
- Symmetric electoral systems for ambient calculi (Q2475806) (← links)
- Leader election in rings of ambient processes (Q2491642) (← links)
- On the Relative Expressive Power of Calculi for Mobility (Q2805161) (← links)
- FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS (Q2856009) (← links)
- Turing universality of the Biochemical Ground Form (Q3550701) (← links)
- Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763) (← links)
- Decidable Fragments of a Higher Order Calculus with Locations (Q5170669) (← links)
- Deciding Reachability in Mobile Ambients with Name Restriction (Q5179047) (← links)
- Reachability Analysis in BioAmbients (Q5179433) (← links)
