A hierarchy of equivalences for asynchronous calculi

No abstract is available for this paper.

• Publication year

  1998

• Venue

  J. Log. Algebraic Methods Program.

• Publication date

  1998-07-13

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.jlap.2004.01.006
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On bisimulations for the asynchronous n-calculus’

  2003influential reference
• The Pi-Calculus - a theory of mobile processes

  2001cited by this paper
• Mobile values, new names, and secure communication

  2001cited by this paper
• Authentication primitives and their compilation

  2000cited by this paper
• An Asynchronous, Distributed Implementation of Mobile Ambients

  2000cited by this paper
• The Join Calculus: A Language for Distributed Mobile Programming

  2000cited by this paper
• Communicating and Mobile Systems: the π-calculus,

  2000cited by this paper
• Bisimulations in the join-calculus

  1998cited by this paper
• On asynchrony in name-passing calculi

  1998cited by this paper
• Proceedings of the 25th International Colloquium on Automata, Languages and Programming

  1998cited by this paper
• On the bisimulation proof method

  1998cited by this paper
• Secure implementation of channel abstractions

  1998cited by this paper
• A foundation for actor computation

  1997cited by this paper
• The interaction of Mn2+ with porous silica xerogels and the hydration-dehydration processes in the xerogels

  1997cited by this paper
• Proceedings of the 8th International Conference on Concurrency Theory

  1997cited by this paper
• Reasoning about Cryptographic Protocols in the Spi Calculus

  1997cited by this paper
• Implicit Typing à la ML for the Join-Calculus

  1997cited by this paper
• May and Must Testing in the Join-Calculus

  1996cited by this paper
• Decoding Choice Encodings

  1996cited by this paper
• Applications of Fair Testing

  1996cited by this paper
• Fair testing

  1995cited by this paper
• Testing Equivalence for Mobile Processes

  1995cited by this paper
• On Reduction-Based Process Semantics

  1995influential reference
• Divergence and Fair Testing

  1995cited by this paper
• The Complete Axiomatization of Cs-congruence

  1994cited by this paper
• Expressing mobility in process algebras : first-order and higher-order paradigms

  1993cited by this paper
• Imperative functional programming

  1993cited by this paper
• The Polyadic π-Calculus: a Tutorial

  1993cited by this paper
• The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves

  1993cited by this paper
• The Linear Time - Branching Time Spectrum II

  1993cited by this paper
• Proceedings of the Third International Conference on Concurrency Theory

  1992cited by this paper
• Asynchrony and the -calculus (note)

  1992cited by this paper
• Multiway Synchronization Verified with Coupled Simulation

  1992cited by this paper
• Barbed Bisimulation

  1992cited by this paper
• The Problem of "Weak Bisimulation up to"

  1992cited by this paper
• On Asynchronous Communication Semantics

  1991cited by this paper
• Calculus of Communicating Systems

  1991influential reference
• Communication and concurrency

  1989cited by this paper
• Algebraic theory of processes

  1988cited by this paper
• Testing Equivalences for Processes

  1984cited by this paper
• Concurrency and Automata on Infinite Sequences

  1981cited by this paper
• Lambda-calculus models of programming languages.

  1969cited by this paper

• Characterizing contrasimilarity through games, modal logic, and complexity

  2024cites this paper
• Processes against tests: On defining contextual equivalences

  2022cites this paper
• A Game Characterization for Contrasimilarity

  2021cites this paper
• Theoretical Computer Science: 39th National Conference of Theoretical Computer Science, NCTCS 2021, Yinchuan, China, July 23–25, 2021, Revised Selected Papers

  2021cites this paper
• Project-Team Moscova Mobility, Security, Concurrency, Verification and Analysis

  2021cites this paper
• Process, Systems and Tests: Three Layers in Concurrent Computation

  2020cites this paper
• Processes, Systems & Tests: Defining Contextual Equivalences

  2020cites this paper
• Coupled similarity: the first 32 years

  2019cites this paper
• Computing Coupled Similarity

  2019cites this paper
• Bisimulation and Coinduction Enhancements: A Historical Perspective

  2019cites this paper
• Virtually timed ambients: A calculus of nested virtualization

  2018cites this paper
• A Calculus of Virtually Timed Ambients

  2016cites this paper
• The Applied Pi Calculus

  2016influential citation
• Recent Trends in Algebraic Development Techniques

  2016cites this paper
• πdist: Towards a Typed π-calculus for Distributed Programming Languages

  2015cites this paper
• dist: Towards a Typed -calculus for Distributed Programming Languages

  2015cites this paper
• Second International Workshop on Rewriting Techniques for Program Transformations and Evaluation

  2015cites this paper
• Observing Success in the Pi-Calculus

  2015cites this paper
• Contextual equivalence for the pi-calculus that can stop

  2014cites this paper
• A General Theory of Barbs, Contexts, and Labels

  2014cites this paper
• Weak Probabilistic Bisimulation

  2014cites this paper
• T. C. C.

  2014cites this paper
• Concurrency cannot be observed, asynchronously†

  2014cites this paper
• Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB

  2014cites this paper
• Structural Rewriting in the π-Calculus

  2014cites this paper
• The Concurrency Column

  2013cites this paper
• Open Bisimulation for Quantum Processes

  2012cites this paper
• Exploring probabilistic bisimulations, part I

  2012cites this paper
• Relating reasoning methodologies in linear logic and process algebra

  2012cites this paper
• Barbed Semantics for Open Reactive Systems

  2012cites this paper
• More on bisimulations for higher order π-calculus

  2012cites this paper
• Adequacy Issues in Reactive Systems: Barbed Semantics for Mobile Ambients

  2011influential citation
• Observational equivalences for linear logic concurrent constraint languages*

  2011influential citation
• On the semantics of Markov automata

  2011cites this paper
• Relating Reasoning Methodologies in Linear Logic and Process Algebra (CMU-CS-11-145, CMU-CS-QTR-111)

  2011cites this paper
• Processes in Space

  2010cites this paper
• Event based choreography

  2010cites this paper
• ANALYSE FORMELLE D'ORCHESTRATIONS DE SERVICES WEB

  2010cites this paper
• A Hierarchy of Behavioral Equivalences in the π-calculus with Noisy Channels

  2010cites this paper
• Explicit fairness in testing semantics

  2009cites this paper
• Calculs de processus: observations et inspections. (Process calculi: observations, inspections)

  2009cites this paper
• Reactive Systems, Barbed Semantics, and the Mobile Ambients

  2009cites this paper
• PiDuce - A project for experimenting Web services technologies

  2009cites this paper
• On Observing Dynamic Prioritised Actions in SOC

  2009cites this paper
• Deconstructing behavioural theories of mobility

  2008cites this paper
• Techniques modulo pour les bisimulations

  2008cites this paper
• A hierarchy of behavioral equivalences in the π-calculus with noisy channels

  2008cites this paper
• Full abstraction for polymorphic pi-calculus

  2008cites this paper
• Secure implementations of typed channel abstractions

  2007cites this paper
• Fe b 20 08 Determinacy in a synchronous π-calculus

  2007cites this paper
• Complete Lattices and Up-To Techniques

  2007cites this paper
• Fair Pi

  2006cites this paper
• Verified interoperable implementations of security protocols

  2006cites this paper
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi

  2006cites this paper
• Fair Π ?

  2006cites this paper
• A synchronous pi-calculus

  2006cites this paper
• Dynamic Web data : a process algebraic approach

  2006cites this paper
• A calculus for reasoning about software composition

  2005cites this paper
• Foundations of Web Transactions

  2005cites this paper
• Contextual equivalence for higher-order pi-calculus revisited

  2005cites this paper
• Contextual Labelled Semantics for Higher-order Process Calculi

  2005cites this paper
• On the Bisimulation Congruence in chi-Calculus

  2005cites this paper
• Full Abstraction for Polymorphic Pi-Calculus

  2005cites this paper
• The SL synchronous language, revisited

  2005cites this paper
• Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi

  2004cites this paper
• Deriving process congruences from reaction rules

  2004cites this paper
• Typed behavioural equivalences for processes in the presence of subtyping

  2004cites this paper
• Towards a theory of bisimulation for the higher-order process calculi

  2004cites this paper
• T C C P    

  2004cites this paper
• Type-based cryptographic operations

  2004cites this paper
• Reduction Semantics for

  2004cites this paper
• Strong Bisimulation for the Explicit Fusion Calculus

  2004cites this paper
• Behavioural Theory for Mobile Ambients

  2004cites this paper
• Reduction Semantics for Ambient Calculi

  2004cites this paper
• Weakest Congruences, Fairness and Compositional Process-Algebraic Verification

  2004influential citation
• Bisimulation Proof Methods for Mobile Ambients

  2003cites this paper
• Solos in concert

  1999cites this paper
• On asynchrony in name-passing calculi

  1998cites this paper