On reduction-based process semantics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4180818 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1479644 (Why is no real title available?)
- A calculus of communicating systems
- A calculus of mobile processes. II
- Barbed bisimulation
- Fully abstract models of typed \(\lambda\)-calculi
- Functions as processes
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Testing equivalences for processes
- The chemical abstract machine
- The lambda calculus. Its syntax and semantics. Rev. ed.
Cited in
(94)- A theory for observational fault tolerance
- Formalising Java RMI with explicit code mobility
- Understanding the mismatch combinator in chi calculus
- Algorithmic type checking for a pi-calculus with name matching and session types
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- On bisimulations for the asynchronous π-calculus
- Event structures for the reversible early internal \(\pi\)-calculus
- Graph types for monadic mobile processes
- Towards a behavioural theory of access and mobility control in distributed systems
- scientific article; zbMATH DE number 7449992 (Why is no real title available?)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- A theory of system behaviour in the presence of node and link failure
- Processes in space
- Asynchronous process calculi: The first- and higher-order paradigms
- Explicit fusions
- From rewrite rules to bisimulation congruences
- On bisimulations for the asynchronous -calculus
- Typed event structures and the linear \(\pi \)-calculus
- Equations, contractions, and unique solutions
- Decoding choice encodings
- A calculus for collective-adaptive systems and its behavioural theory
- The seal calculus
- Reaction graph
- Communication and mobility control in boxed ambients
- Precise subtyping for synchronous multiparty sessions
- safeDpi: a language for controlling mobile code
- \(\pi\)-calculus with noisy channels
- Open bisimulation, revisited
- Process calculus based upon evaluation to committed form
- Exploring probabilistic bisimulations. I
- Security abstractions and intruder models (extended abstract)
- The SL synchronous language, revisited
- Relating reasoning methodologies in linear logic and process algebra
- Towards a unified approach to encodability and separation results for process calculi
- On the Power of Attribute-Based Communication
- Full abstraction for polymorphic \(\pi \)-calculus
- Characteristic bisimulation for higher-order session processes
- Behavioural equivalences for dynamic web data
- On the expressiveness and decidability of higher-order process calculi
- On an open problem of Amadio and Curien: The finite antichain condition
- Making the unobservable, unobservable
- An observational theory for mobile ad hoc networks (full version)
- Bisimulation and co-induction: some problems
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
- First-order reasoning for higher-order concurrency
- Decoding choice encodings
- Secure implementation of channel abstractions
- Bisimulations in the join-calculus
- Monitoring networks through multiparty session types
- Basic observables for a calculus for global computing
- Linear forwarders
- A behavioural theory for a \(\pi\)-calculus with preorders
- Linear lambda calculus and deep inference
- Modelling dynamic web data
- Mobile objects as mobile processes
- Tau laws for pi calculus
- On asynchronous eventful session semantics
- The two-phase commitment protocol in an extended \(\pi\)-calculus
- Concurrency cannot be observed, asynchronously
- A synchronous -calculus
- A Process-Model for Linear Programs
- A calculus of mobile agents
- Deriving bisimulation congruences: a 2-categorical approach
- Strong normalisation in the \(\pi\)-calculus
- Name-passing calculi: from fusions to preorders and types
- Complete Lattices and Up-To Techniques
- On the relative expressiveness of higher-order session processes
- A hierarchy of equivalences for asynchronous calculi
- A theory of reduced and minimal procedural dependencies
- Channel abstractions for network security
- Expressiveness of concurrent intensionality
- Contextual equivalence for signal flow graphs
- Contextual equivalences in configuration structures and reversibility
- On the relative expressiveness of higher-order session processes
- Space-aware ambients and processes
- Virtually timed ambients: a calculus of nested virtualization
- On convergence-sensitive bisimulation and the embedding of CCS in timed CCS
- Processes, systems \& tests: defining contextual equivalences
- Linearity and bisimulation
- A behavioural theory for a \(\pi\)-calculus with preorders
- A theory of bisimulation for a fragment of concurrent ML with local names
- On the expressiveness of pure mobile ambients
- Forward-reverse observational equivalences in CCSK
- Variations on mobile processes
- Reactive Systems, Barbed Semantics, and the Mobile Ambients
- Distinguishing between communicating transactions
- Symmetries and Dualities in Name-Passing Process Calculi
- A semantic theory of the Internet of Things
- Extensionality of spatial observations in distributed systems
- Programming Languages and Systems
- Comparing communication primitives via their relative expressive power
- An Observational Theory for Mobile Ad Hoc Networks
- Theory of interaction
- Processes against tests: on defining contextual equivalences
This page was built for publication: On reduction-based process semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350347)
