Pages that link to "Item:Q1350347"
From MaRDI portal
The following pages link to On reduction-based process semantics (Q1350347):
Displaying 50 items.
- Name-passing calculi: from fusions to preorders and types (Q342734) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Processes in space (Q418828) (← links)
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- Monitoring networks through multiparty session types (Q517050) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- The SL synchronous language, revisited (Q864504) (← links)
- Space-aware ambients and processes (Q875514) (← links)
- A behavioural theory for a \(\pi\)-calculus with preorders (Q890617) (← links)
- Theory of interaction (Q896903) (← links)
- A theory of system behaviour in the presence of node and link failure (Q939442) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Linearity and bisimulation (Q997996) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- An observational theory for mobile ad hoc networks (full version) (Q1012124) (← links)
- Reaction graph (Q1273068) (← links)
- On bisimulations for the asynchronous \(\pi\)-calculus (Q1276246) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- Virtually timed ambients: a calculus of nested virtualization (Q1683706) (← links)
- Distinguishing between communicating transactions (Q1706141) (← links)
- A semantic theory of the Internet of things (Q1706144) (← links)
- A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
- Understanding the mismatch combinator in chi calculus (Q1853614) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Secure implementation of channel abstractions (Q1854520) (← links)
- Towards a behavioural theory of access and mobility control in distributed systems (Q1881259) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- Variations on mobile processes (Q1960530) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Expressiveness of concurrent intensionality (Q2193283) (← links)
- Contextual equivalence for signal flow graphs (Q2200814) (← links)
- On the relative expressiveness of higher-order session processes (Q2272988) (← links)
- A calculus for collective-adaptive systems and its behavioural theory (Q2272994) (← links)
- Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
- A synchronous \(\pi\)-calculus (Q2381508) (← links)
- Basic observables for a calculus for global computing (Q2384924) (← links)
- Linear forwarders (Q2384926) (← links)
- Precise subtyping for synchronous multiparty sessions (Q2423747) (← links)
- Algorithmic type checking for a pi-calculus with name matching and session types (Q2436508) (← links)
- Formalising Java RMI with explicit code mobility (Q2463558) (← links)
- Open bisimulation, revisited (Q2465030) (← links)
- Behavioural equivalences for dynamic web data (Q2474049) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- Mobile objects as mobile processes (Q2497145) (← links)
- Modelling dynamic web data (Q2566029) (← links)
