A calculus of mobile processes. I

DOI10.1016/0890-5401(92)90008-4zbMath0752.68036OpenAlexW2128932399WikidataQ56019902 ScholiaQ56019902MaRDI QIDQ1198548

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)90008-4

zbMATH Keywords

process algebra mobility processes labeled transition system calculus of communicating systems strong bisimilarity strong equivalence distinctions

Mathematics Subject Classification ID

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)

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties ⋮ Mixed Sessions ⋮ Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Strong types for coordinating active objects ⋮ Topological models for higher order control flow ⋮ A categorical framework for congruence of applicative bisimilarity in higher-order languages ⋮ From π-calculus to higher-order π-calculus — and back ⋮ Specification and verification for semi-structured data ⋮ More problems in rewriting ⋮ From a concurrent λ-calculus to the π-calculus ⋮ Stratified petri nets ⋮ Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming ⋮ The name discipline of uniform receptiveness (extended abstract) ⋮ On confluence in the π-calculus ⋮ A proof theoretical approach to communication ⋮ A programming model and foundation for lineage-based distributed computation ⋮ Unnamed Item ⋮ π-Calculus semantics of object-oriented programming languages ⋮ A foundation for higher-order concurrent constraint programming ⋮ On the decidability of process equivalences for the π-calculus ⋮ πI: A symmetric calculus based on internal mobility ⋮ Complete inference systems for weak bisimulation equivalences in the π-calculus ⋮ Confluence of processes and systems of objects ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Abstract interpretation of temporal concurrent constraint programs ⋮ On first-order runtime enforcement of branching-time properties ⋮ Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication ⋮ Modular rewritable Petri nets: an efficient model for dynamic distributed systems ⋮ Lang-n-Send Extended: Sending Regular Expressions to Monitors ⋮ The reflective higher-order calculus: encodability, typability and separation ⋮ A model of actors and grey failures ⋮ A full process algebraic representation of ant colony optimization ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ Algebraic interpretation of lambda calculus with resources ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Unnamed Item ⋮ A Graph Transformation View on the Specification of Applications using Mobile Code* *Research partially supported by project ForMOS (Métodos Formais para Código Móvelem Sistemas Abertos) - grant CNPq 520269/98-5, by the Research Training Network GET-GRATS (General Theory of Graph Transformation Systems), and by the MURST project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Psi-calculi in Isabelle ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The consistent use of names and polymorphism in the definition of Object Petri Nets ⋮ Behaviour, Interaction and Dynamics ⋮ Model checking with probabilistic tabled logic programming ⋮ Towards Secrecy for Rewriting in Weakly Adhesive Categories ⋮ A Model of Dynamic Systems ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ A Resource Analysis of the π-calculus ⋮ Encryption as an abstract data-type ⋮ Equivalence relations for modular performance evaluation in dtsPBC ⋮ cJoin: Join with communicating transactions ⋮ CaSPiS: a calculus of sessions, pipelines and services ⋮ Model checking usage policies ⋮ Non-deterministic structures of computation ⋮ On recursive operations over logic LTS ⋮ Linearity, session types and the Pi calculus ⋮ On asynchronous eventful session semantics ⋮ An extensible approach to session polymorphism ⋮ Pict Correctness Revisited ⋮ Unnamed Item ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Proof-relevant π-calculus: a constructive account of concurrency and causality ⋮ Distributed processes and location failures ⋮ Types for ambient and process mobility ⋮ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions ⋮ Open Bisimulation for the Concurrent Constraint Pi-Calculus ⋮ The Conversation Calculus: A Model of Service-Oriented Computation ⋮ Unnamed Item ⋮ A Fresh Look at the λ-Calculus ⋮ On parameterization of higher-order processes ⋮ Completeness and Herbrand theorems for nominal logic ⋮ Analysing Spatial Properties on Neighbourhood Spaces ⋮ EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS ⋮ Journeys in non-classical computation I: A grand challenge for computing research ⋮ On the expressive power of recursion, replication and iteration in process calculi ⋮ Deciding reachability problems in Turing-complete fragments of Mobile Ambients ⋮ Mobile Petri nets ⋮ A logical analysis of aliasing in imperative higher-order functions ⋮ Applying a testing approach to the Calculus of Fair Ambients ⋮ General patterns of interaction in stochastic fusion ⋮ On sequential composition, action prefixes and process prefix ⋮ Dynamic spaces in concurrent constraint programming ⋮ A strand graph semantics for DNA-based computation ⋮ Modelling biochemical pathways through enhanced \(\pi\)-calculus ⋮ Tau laws for pi calculus ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ A formal semantics for DAI language NUML ⋮ Event-based run-time adaptation in communication-centric systems ⋮ Asynchronous communication model based on linear logic ⋮ Verifying a distributed list system: A case history ⋮ A theory of bisimulation for the \(\pi\)-calculus ⋮ A functional presentation of pi calculus

Cites Work

This page was built for publication: A calculus of mobile processes. I