Sciweavers

23 search results - page 3 / 5
» A Characterisation of Weak Bisimulation Congruence
Sort
View
FOSSACS
2009
Springer
14 years 28 days ago
Normal Bisimulations in Calculi with Passivation
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
Sergueï Lenglet, Alan Schmitt, Jean-Bernard S...
LICS
2010
IEEE
13 years 4 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
IFIPTCS
2000
13 years 9 months ago
Open Ended Systems, Dynamic Bisimulation and Tile Logic
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
Roberto Bruni, Ugo Montanari, Vladimiro Sassone
MFCS
1991
Springer
13 years 9 months ago
CCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
Ugo Montanari, Vladimiro Sassone
IANDC
2000
64views more  IANDC 2000»
13 years 6 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink