A calculus of mobile processes. II
From MaRDI portal
Publication:1198549
DOI10.1016/0890-5401(92)90009-5zbMath0752.68037OpenAlexW2013672985MaRDI QIDQ1198549
Publication date: 16 January 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90009-5
process algebramobilityprocesseslabeled transition systemcalculus of communicating systemsstrong bisimilaritystrong equivalencedistinctions
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (only showing first 100 items - show all)
Specification and refinement of mobile systems in MTLA and mobile UML ⋮ Declarative event based models of concurrency and refinement in psi-calculi ⋮ GSOS and finite labelled transition systems ⋮ Proofs as processes ⋮ PiDuce- A project for experimenting web services technologies ⋮ A closer look at constraints as processes ⋮ On reduction-based process semantics ⋮ A \(\pi\)-calculus with explicit substitutions ⋮ Type checking a multithreaded functional language with session types ⋮ A pi-calculus based semantics for WS-BPEL ⋮ Orchestrated session compliance ⋮ Models for name-passing processes: Interleaving and causal ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ SOS formats and meta-theory: 20 years after ⋮ A process algebraic view of Linda coordination primitives ⋮ A process-calculus-based abstraction for coordinating multi-agent groups ⋮ Some congruence properties for \(\pi\)-calculus bisimilarities ⋮ On the decidability of process equivalences for the \(\pi\)-calculus ⋮ Conversation types ⋮ External equality and absolute equality coincide in finite CCS and \(\pi\) calculus without summation ⋮ A semantic theory for value-passing processes based on the late approach ⋮ Theory of interaction ⋮ Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus. ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ An algebra of behavioural types ⋮ Static slicing of explicitly synchronized languages ⋮ Reachability problems in BioAmbients ⋮ Foundational aspects of multiscale modeling of biological systems with process algebras ⋮ Value-passing CCS with noisy channels ⋮ More on bisimulations for higher order \(\pi\)-calculus ⋮ On the analysis of compensation correctness ⋮ A timed calculus for wireless systems ⋮ Inheritance in the join calculus. ⋮ The logic of message-passing ⋮ Hybrid I/O automata. ⋮ Aeolus: a component model for the cloud ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ Domain theory for concurrency ⋮ Security types for dynamic web data ⋮ Extensional Petri net ⋮ Reversible session-based pi-calculus ⋮ \(\pi\)-calculus, internal mobility, and agent-passing calculi ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ Locality and interleaving semantics in calculi for mobile processes ⋮ A multiset semantics for the pi-calculus with replication ⋮ Late and early semantics coincide for testing ⋮ A language-based approach to modelling and analysis of Twitter interactions ⋮ Computational self-assembly ⋮ A simple calculus for proteins and cells ⋮ Modal logics for mobile processes ⋮ A calculus of mobile processes. I ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ Approximate reasoning in the algebra of bounded rational agents ⋮ An algebraic verification of a mobile network ⋮ A process calculus for mobile ad hoc networks ⋮ Turing machines, transition systems, and interaction ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ On the expressibility of priority ⋮ A principled exploration of coordination models ⋮ A fully abstract may testing semantics for concurrent objects ⋮ A thread calculus with molecular dynamics ⋮ Abstract interpretation based verification of temporal properties for BioAmbients ⋮ Linearity and bisimulation ⋮ Deadlock analysis of unbounded process networks ⋮ Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications ⋮ M-nets: a survey ⋮ A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ An observational theory for mobile ad hoc networks (full version) ⋮ A congruence rule format for name-passing process calculi ⋮ Asynchronous sequential processes ⋮ Objects and session types ⋮ An interpretation of typed objects into typed \(\pi\)-calculus ⋮ A conservative look at operational semantics with variable binding ⋮ Multisets and structural congruence of the pi-calculus with replication ⋮ Partial confluence of processes and systems of objects ⋮ Process calculus based upon evaluation to committed form ⋮ A process algebra with distributed priorities ⋮ On transformations of concurrent-object programs ⋮ On bisimulations for the asynchronous \(\pi\)-calculus ⋮ Non-interleaving semantics for mobile processes ⋮ On modelling mobility ⋮ Mobile ambients ⋮ Types for access control ⋮ A complexity analysis of bisimilarity for value-passing processes ⋮ Linda-based applicative and imperative process algebras ⋮ Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability ⋮ A hidden agenda ⋮ The lambda-context calculus (extended version) ⋮ Names of the \(\pi\)-calculus agents handled locally ⋮ Proof nets, garbage, and computations ⋮ \(\pi\)-calculus in (Co)inductive-type theory ⋮ Primitives for authentication in process algebras. ⋮ Validating firewalls using flow logics ⋮ Dynamic connectors for concurrency ⋮ Compositional SOS and beyond: A coalgebraic view of open systems ⋮ A fully abstract denotational semantics for the \(\pi\)-calculus ⋮ Analysis issues in Petri nets with inhibitor arcs ⋮ A causal semantics for CCS via rewriting logic ⋮ Towards an algebraic theory of typed mobile processes
Cites Work
This page was built for publication: A calculus of mobile processes. II
