The following pages link to A calculus of mobile processes. I (Q1198548):
Displaying 50 items.
- General patterns of interaction in stochastic fusion (Q272780) (← links)
- Dynamic spaces in concurrent constraint programming (Q281160) (← links)
- A strand graph semantics for DNA-based computation (Q288814) (← links)
- Event-based run-time adaptation in communication-centric systems (Q315279) (← links)
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- Foundational aspects of multiscale modeling of biological systems with process algebras (Q418838) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- A survey of constraint-based programming paradigms (Q458465) (← links)
- A calculus of trustworthy ad hoc networks (Q470043) (← links)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Preface to the special volume (Q534064) (← links)
- Partial order semantics for use case and task models (Q539426) (← links)
- Contracts for security adaptation (Q541291) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- On quasi-open bisimulation (Q557789) (← links)
- QoS negotiation in service composition (Q615894) (← links)
- Validation and verification of web services choreographies by using timed automata (Q615897) (← links)
- An accessible verification environment for UML models of services (Q617979) (← links)
- Symmetries, local names and dynamic (de)-allocation of names (Q618165) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- Forum: A multiple-conclusion specification logic (Q671512) (← links)
- Modal logics for mobile processes (Q685408) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Data flow analysis of distributed communicating processes (Q751233) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← links)
- A functional presentation of pi calculus (Q865929) (← links)
- A bulk-synchronous parallel process algebra (Q875955) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Fair ambients (Q877172) (← links)
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
- Subexponential concurrent constraint programming (Q897936) (← links)
- Typed context awareness ambient calculus for pervasive applications (Q903500) (← links)
- The logic of message-passing (Q923880) (← links)
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
- Parametric synchronizations in mobile nominal calculi (Q935464) (← links)
- A compositional Petri net translation of general \(\pi\)-calculus terms (Q939164) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- A spatial equational logic for the applied \(\pi \)-calculus (Q992517) (← links)
- Pict correctness revisited (Q1004056) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- A type safe state abstraction for coordination in JAVA-like languages (Q1006341) (← links)
- A barred operational semantics for a subset of WS-CDL with time restrictions (Q1035678) (← links)
- A calculus of mobile processes. II (Q1198549) (← links)
- An algebraic verification of a mobile network (Q1205185) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- Reaction graph (Q1273068) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
