The following pages link to (Q2760245):
Displaying 32 items.
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- More on bisimulations for higher order \(\pi\)-calculus (Q442289) (← links)
- A calculus of quality for robustness against unreliable communication (Q492911) (← links)
- Abstract reduction in directed model checking CCS processes (Q715051) (← links)
- Theory of interaction (Q896903) (← links)
- A compositional Petri net translation of general \(\pi\)-calculus terms (Q939164) (← links)
- A process calculus for mobile ad hoc networks (Q967528) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- Complexity analysis of new task allocation problem using network flow method on multicore clusters (Q1719030) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Correct audit logging in concurrent systems (Q2229154) (← links)
- What is a free name in a process algebra? (Q2379969) (← links)
- Basic observables for a calculus for global computing (Q2384924) (← links)
- Open bisimulation, revisited (Q2465030) (← links)
- Free-algebra models for the \(\pi \)-calculus (Q2474057) (← links)
- Symmetric electoral systems for ambient calculi (Q2475806) (← links)
- On the expressive power of \textsc{Klaim}-based calculi (Q2491638) (← links)
- Ensuring termination by typability (Q2500473) (← links)
- An Epistemic Predicate CTL* for Finite Control π-Processes (Q2825420) (← links)
- Synchrony vs Asynchrony in Communication Primitives (Q2866346) (← links)
- A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle (Q2871830) (← links)
- A Formal Environment Model for Multi-Agent Systems (Q2999310) (← links)
- PiStache: Implementing π-Calculus in Scala (Q3098054) (← links)
- On the expressiveness of π-calculus for encoding mobile ambients (Q3130299) (← links)
- A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus (Q3185762) (← links)
- Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus (Q3613062) (← links)
- (Q5111635) (← links)
- Asynchronous Logic Circuits and Sheaf Obstructions (Q5179025) (← links)
- The reflective higher-order calculus: encodability, typability and separation (Q6124241) (← links)
- The synchronized ambient calculus (Q6204540) (← links)
- A generic type system for higher-order \(\Psi\)-calculi (Q6614878) (← links)
- Processes, systems \& tests: defining contextual equivalences (Q6649539) (← links)
