On reduction-based process semantics

DOI10.1016/0304-3975(95)00074-7zbMath0871.68122OpenAlexW2072048176MaRDI QIDQ1350347

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00074-7

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Characteristic bisimulation for higher-order session processes, Towards a behavioural theory of access and mobility control in distributed systems, A theory of bisimulation for a fragment of concurrent ML with local names, Tau laws for pi calculus, A Behavioural Theory for a π-calculus with Preorders, A synchronous \(\pi\)-calculus, A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types, Basic observables for a calculus for global computing, Linear forwarders, A theory for observational fault tolerance, Name-passing calculi: from fusions to preorders and types, Contextual equivalences in configuration structures and reversibility, The SL synchronous language, revisited, Strong normalisation in the \(\pi\)-calculus, Space-aware ambients and processes, Symmetries and Dualities in Name-Passing Process Calculi, Virtually timed ambients: a calculus of nested virtualization, Complete Lattices and Up-To Techniques, A behavioural theory for a \(\pi\)-calculus with preorders, On bisimulations for the asynchronous π-calculus, A calculus of mobile agents, Theory of interaction, Precise subtyping for synchronous multiparty sessions, Expressiveness of concurrent intensionality, On the expressiveness and decidability of higher-order process calculi, Exploring probabilistic bisimulations. I, Processes in space, Contextual equivalence for signal flow graphs, Distinguishing between communicating transactions, A semantic theory of the Internet of things, Algorithmic type checking for a pi-calculus with name matching and session types, Unnamed Item, Towards a unified approach to encodability and separation results for process calculi, Variations on mobile processes, First-order reasoning for higher-order concurrency, Towards a Unified Approach to Encodability and Separation Results for Process Calculi, Channel abstractions for network security, A theory of system behaviour in the presence of node and link failure, Formalising Java RMI with explicit code mobility, Open bisimulation, revisited, Linear Lambda Calculus and Deep Inference, Monitoring networks through multiparty session types, Behavioural equivalences for dynamic web data, Full abstraction for polymorphic \(\pi \)-calculus, Forward-Reverse Observational Equivalences in CCSK, The Two-Phase Commitment Protocol in an Extended π-Calculus, On the Expressiveness of Pure Mobile Ambients, Making the Unobservable, Unobservable, Typed event structures and the linear \(\pi \)-calculus, On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS, Security Abstractions and Intruder Models (Extended Abstract), Concurrency cannot be observed, asynchronously, Decoding choice encodings, On asynchronous eventful session semantics, Relating reasoning methodologies in linear logic and process algebra, An exact correspondence between a typed pi-calculus and polarised proof-nets, A hierarchy of equivalences for asynchronous calculi, Mobile objects as mobile processes, On the relative expressiveness of higher-order session processes, A calculus for collective-adaptive systems and its behavioural theory, From rewrite rules to bisimulation congruences, Bisimulations in the join-calculus, Linearity and bisimulation, On the Relative Expressiveness of Higher-Order Session Processes, Reactive Systems, Barbed Semantics, and the Mobile Ambients, Comparing communication primitives via their relative expressive power, Equations, Contractions, and Unique Solutions, Event structures for the reversible early internal \(\pi\)-calculus, An observational theory for mobile ad hoc networks (full version), A Process-Model for Linear Programs, Reaction graph, On the Power of Attribute-Based Communication, On bisimulations for the asynchronous \(\pi\)-calculus, Deriving Bisimulation Congruences: A 2-categorical Approach, Processes against tests: on defining contextual equivalences, Modelling dynamic web data, Explicit fusions, The seal calculus, \(\pi\)-calculus with noisy channels, Communication and mobility control in boxed ambients, On an open problem of Amadio and Curien: The finite antichain condition, Asynchronous process calculi: The first- and higher-order paradigms, Understanding the mismatch combinator in chi calculus, Decoding choice encodings, Secure implementation of channel abstractions, safeDpi: a language for controlling mobile code, Extensionality of Spatial Observations in Distributed Systems, An Observational Theory for Mobile Ad Hoc Networks, Bisimulation and Co-induction: Some Problems

Cites Work