Results 1  10
of
12
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
are simulated. Computing quotients for simulation equivalence is more expensive than for bisimulation equivalence, as for simulation one has to account for the socalled little brothers, which represent classes of states that can simulate other classes. It is known that in the absence of little brother states
Uniform logical characterizations of testing equivalences for nondeterministic, probabilistic and Markovian processes
 In Proc. of the 7th Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2009), volume 253(3) of ENTCS
, 2009
"... Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equivalence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations of the corresponding variants of trace equivalence rely on s ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equivalence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations of the corresponding variants of trace equivalence rely
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 equivalence
Bisimulation Metrics are Optimal Value Functions Norm Ferns ∗
"... Bisimulation is a notion of behavioural equivalence on the states of a transition system. Its definition has been extended to Markov decision processes, where it can be used to aggregate states. A bisimulation metric is a quantitative analog of bisimulation that measures how similar states are fr ..."
Abstract
 Add to MetaCart
Bisimulation is a notion of behavioural equivalence on the states of a transition system. Its definition has been extended to Markov decision processes, where it can be used to aggregate states. A bisimulation metric is a quantitative analog of bisimulation that measures how similar states
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
equivalences exponential lower and upper bounds are proven. We also show that this problem is NP hard and coNP hard even for a class of very simple finite agents. Dataflow nets are the simplest systems of asynchronously communicating agents. Let,,, be an equivalence which lies between strong
Refining the Undecidability Border of Weak Bisimilarity
"... Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras ( ..."
Abstract
 Add to MetaCart
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras
Congruences for Stochastic Relations
, 2003
"... We discuss congruences for stochastic relations, stressing the equivalence of smooth equivalence relations and countably generated σalgebras. Factor spaces are constructed for congruences and for morphisms. Semipullbacks are needed when investigating the interplay between congruences and bisimul ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We discuss congruences for stochastic relations, stressing the equivalence of smooth equivalence relations and countably generated σalgebras. Factor spaces are constructed for congruences and for morphisms. Semipullbacks are needed when investigating the interplay between congruences
Creative Commons Attribution License. Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior
"... Several application domains require formal but flexible approaches to the comparison problem. Different process models that cannot be related by behavioral equivalences should be compared via a quantitative notion of similarity, which is usually achieved through approximation of some equivalence. ..."
Abstract
 Add to MetaCart
Several application domains require formal but flexible approaches to the comparison problem. Different process models that cannot be related by behavioral equivalences should be compared via a quantitative notion of similarity, which is usually achieved through approximation of some equivalence
Game Characterizations of Timed Relations for Timed Automata Processes
"... Abstract. In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling’s bisimulation games. If it is the case that the existence of a winning st ..."
Abstract
 Add to MetaCart
Abstract. In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling’s bisimulation games. If it is the case that the existence of a winning
Brzozowski’s and upto algorithms for must testing?
"... Abstract. Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more effective solutions, such as approaches based on antichains or bisimulations upto. Several notions of equiv ..."
Abstract
 Add to MetaCart
of equivalence (or preorder) have been proposed for the analysis of concurrent systems. Usually, the problem of checking these equivalences is reduced to checking bisimilarity. In this paper, we take a different approach and propose to adapt algorithms for language equivalence to check one prime equivalence
Results 1  10
of
12