Results 1  10
of
17
Bisimulation through probabilistic testing
 in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL
, 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract

Cited by 529 (14 self)
 Add to MetaCart
close to one, between processes that are not bisimulation equivalent. We also show a similar result (in a slightly stronger form) for a new process relation called $bisimulationwhich lies strictly between that of simulation and bisimulation. Finally, the ultimately strength of the testing language
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes (Extended Abstract)
 LICS'98
, 1998
"... We present the fusion calculus as a significant step towards a canonical calculus of concurrency. It simplifies and extends the πcalculus.
The fusion calculus contains the polyadic πcalculus as a proper subcalculus and thus inherits all its expressive power. The gain is that fusion contains action ..."
Abstract

Cited by 139 (15 self)
 Add to MetaCart
prove that the calculus contains the πcalculus as a subcalculus. We define and motivate the bisimulation equivalence and prove a simple characterization of its induced congruence, which is given two versions of a complete axiomatization for finite terms. The expressive power of the calculus
Scalable Minimization Algorithm for Partial Bisimulation
"... We present an efficient algorithm for computing the partial bisimulation preorder and equivalence for labeled transitions systems. The partial bisimulation preorder lies between simulation and bisimulation, as only a part of the set of actions is bisimulated, whereas the rest of the actions are sim ..."
Abstract
 Add to MetaCart
We present an efficient algorithm for computing the partial bisimulation preorder and equivalence for labeled transitions systems. The partial bisimulation preorder lies between simulation and bisimulation, as only a part of the set of actions is bisimulated, whereas the rest of the actions
Checking Equivalences between Concurrent Systems of Finite Agents
 19th International Colloquium on Automata, Languages and Programming
, 1992
"... Consider two synchronously communicating systems p and q over finite agents. Assume that one wants to check whether p, ~ q for one of the commonly used equivalences. We show that this question is PSPACE hard for all equivalences which lie between strong bisimulation and trace equivalences. For some ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
Consider two synchronously communicating systems p and q over finite agents. Assume that one wants to check whether p, ~ q for one of the commonly used equivalences. We show that this question is PSPACE hard for all equivalences which lie between strong bisimulation and trace equivalences. For some
On the Bisimulation Congruence in χCalculus
"... Abstract. In this paper, we study weak bisimulation congruences for the χcalculus, a symmetric variant of the πcalculus. We distinguish two styles of such bisimulation definitions, i.e. “open ” and “closed ” bisimulation, the difference between which lies in that in open style the equivalence is ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we study weak bisimulation congruences for the χcalculus, a symmetric variant of the πcalculus. We distinguish two styles of such bisimulation definitions, i.e. “open ” and “closed ” bisimulation, the difference between which lies in that in open style the equiva
Model checking fixed point logic with chop
 In Procs. of the 5th Conf. on Foundations of Software Science and Computation Structures (FOSSACS’02), volume 2303 of LNCS
, 2002
"... Abstract. This paper examines FLC, which is the modal µcalculus enriched with a sequential composition operator. Bisimulation invariance and the tree model property are proved. Its succinctness is compared to the modal µcalculus. The main focus lies on FLC’s model checking problem over finite tran ..."
Abstract

Cited by 21 (12 self)
 Add to MetaCart
Abstract. This paper examines FLC, which is the modal µcalculus enriched with a sequential composition operator. Bisimulation invariance and the tree model property are proved. Its succinctness is compared to the modal µcalculus. The main focus lies on FLC’s model checking problem over finite
Calculating invariants as coreflexive bisimulations
, 2008
"... Invariants, bisimulations and assertions are the main ingredients of coalgebra theory applied to computer systems engineering. In this paper we reduce the first to a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates as ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
Invariants, bisimulations and assertions are the main ingredients of coalgebra theory applied to computer systems engineering. In this paper we reduce the first to a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates
On Modelling Mobility
 Theoretical Computer Science
, 1999
"... We present a model of distributed computation which is based on a fragment of the ßcalculus relying on asynchronous pointtopoint communication. We enrich the model with the following features: the explicit distribution of processes to locations, the routing of messages, the mobility of processes, ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
: ßcalculus, bisimulation, mobility, localities. 1 Introduction Traditional process calculi such as CCS and CSP lie their foundations on a reduced set of concepts and therefore do not provide direct support for the modelling of certain relevant aspects of systems such as the distribution of resources
Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers
"... We study both the expressive and the distinguishing powers of at temporal logics. These are fragments obtained by restricting the rst argument of the Until operator to propositional formulae. Both the lineartime and the branchingtime cases are considered. Keywords: temporal logic, LTL, CTL, expre ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
, expressiveness, bisimulation 1 Introduction Temporal logic lies at the basis of several specication formalisms that are widely used in practice. For a large part, this acceptance stems from the availability of software tools for automated verication, that allow to prove or disprove the satisfaction of a
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents
, 1995
"... A concurrent system of synchronous communicating agents is assembled from simpler sequential agents by parallel composition and hiding. For example, hide a 1 ; : : : a l in (p 1 kp 2 : : : kpn ) describes the system of communicating agents p 1 ; : : : pn in which the communication events a 1 ; : : : ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
A concurrent system of synchronous communicating agents is assembled from simpler sequential agents by parallel composition and hiding. For example, hide a 1 ; : : : a l in (p 1 kp 2 : : : kpn ) describes the system of communicating agents p 1 ; : : : pn in which the communication events a 1
Results 1  10
of
17