Pages that link to "Item:Q3655763"
From MaRDI portal
The following pages link to Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763):
Displaying 8 items.
- Reachability problems in BioAmbients (Q418830) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← links)
- On the computational strength of pure ambient calculi (Q1763730) (← links)
- When ambients cannot be opened (Q1770415) (← links)
- On the computational strength of pure ambient calculi (Q2847404) (← links)
- Deciding Reachability in Mobile Ambients with Name Restriction (Q5179047) (← links)
- Programming Languages and Systems (Q5316568) (← links)