Sciweavers

27 search results - page 2 / 6
» Strong Splitting Bisimulation Equivalence
Sort
View
IANDC
2010
68views more  IANDC 2010»
13 years 3 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
CONCUR
1995
Springer
13 years 9 months ago
Bisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
Matthew Hennessy, Julian Rathke
ICALP
1998
Springer
13 years 9 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
APAL
2000
84views more  APAL 2000»
13 years 5 months ago
Strong Splitting in Stable Homogeneous Models
In this paper we study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [Hy]. We apply this to prove a structure theorem. We...
Tapani Hyttinen, Saharon Shelah
SEFM
2006
IEEE
13 years 11 months ago
On Bisimilarities Induced by Relations on Actions
In this paper, we give a straightforward generalization of bisimulations to "bisimulations induced by a pair of relations" on the underlying action set. We establish tha...
S. Arun-Kumar