Results 1  10
of
312
Strong Bisimulation for the Explicit Fusion Calculus
, 2004
"... The pi calculus holds the promise of compiletime checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulation. In the synchronous pi calculus, it is wellknown that the various natural definitions of (strong) bisimulation y ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
The pi calculus holds the promise of compiletime checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulation. In the synchronous pi calculus, it is wellknown that the various natural definitions of (strong) bisimulation
A Distributed Algorithm for Strong Bisimulation Reduction of State Spaces
 SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER
"... It is a known problem that state spaces can grow very large, which makes operating on them (including reducing them) difficult because of operational memory shortage. In an attempt to extend the size of the state spaces that can be dealt with, we designed and implemented a bisimulation reduction al ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
algorithm for distributed memory settings using message passing communication. By using message passing, the same implementation can be used on both clusters of workstations and large shared memory machines. The algorithm performs reduction of large labeled transition systems modulo strong bisimulation. We
Bisimulation
"... ion In concurrency theory it is often useful to distinguish between internal actions, that do not admit interactions with the outside world, and external ones. As normally there is no need to distinguish the internal actions from each other, they all have the same name, namely . If A is the set of ..."
Abstract
 Add to MetaCart
of external actions a certain class of systems may perform, then A := A . [ fg. Systems in that class are then represented by labelled transition systems over A and a set of predicates P . The variant of bisimulation equivalence that treats just like any action of A is called strong bisimulation
Branching Time and Abstraction in Bisimulation Semantics
 JOURNAL OF THE ACM
, 1996
"... In comparative concurrency semantics, one usually distinguishes between linear time and branching time semantic equivalences. Milner’s notion of ohsen~ation equirlalence is often mentioned as the standard example of a branching time equivalence. In this paper we investigate whether observation equi ..."
Abstract

Cited by 331 (17 self)
 Add to MetaCart
actions) and the usual laws for strong congruence. WC also establish that for sequential processes observation equivalence is not preserved under refinement of actions, whereas branching bisimulation is. For a large class of processes, it turns out that branching bisimulation and observation equivalence
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
indexed by distinctionsi.e., assumptions of inequality among names. These theories are based upon a semantics in terms of a labeled transition system and a notion of strong bisimulation, both of which are expounded in detail in a companion paper. We also report briefly on workinprogress based upon
Decidability of Strong Bisimulation of Basic Parallel Processes using Hilbert's Basis Theorem
, 1997
"... ..."
Bisimulation from Open Maps
 INFORMATION AND COMPUTATION
, 1994
"... An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction f ..."
Abstract

Cited by 143 (43 self)
 Add to MetaCart
from Petri nets) and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a revision of historypreserving bisimulation of Rabinovitch and Traktenbrot, Goltz
Strong splitting bisimulation equivalence
 Eindhoven University of Technology
, 2005
"... Abstract. We present ACP c, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possib ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
it possible to present ACP c in a concise and intuitively clear way, and to bring the notion of splitting bisimulation equivalence and the issue of condition evaluation in process algebras with conditional expressions to the forefront. 1
Back and forth bisimulations
 Computer Science Report CS R9021, Centrum voor Wiskunde en Informatica
, 1990
"... This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation le ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation
Bisimulation and Open Maps
 In Proc. LICS'93, Eighth Annual Symposium on Logic in Computer Science
, 1993
"... An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from ..."
Abstract

Cited by 41 (7 self)
 Add to MetaCart
Petri nets) and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a revision of historypreserving bisimulation of Rabinovitch and Traktenbrot, Goltz and van
Results 1  10
of
312