Sciweavers

39 search results - page 3 / 8
» A Categorical Axiomatics for Bisimulation
Sort
View
ENTCS
2002
95views more  ENTCS 2002»
13 years 9 months ago
Deriving Bisimulation Congruences: A 2-categorical Approach
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for p...
Vladimiro Sassone, Pawel Sobocinski
IANDC
2010
116views more  IANDC 2010»
13 years 8 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
FORTE
2007
13 years 11 months ago
New Bisimulation Semantics for Distributed Systems
Bisimulation semantics are a very pleasant way to define the semantics of systems, mainly because the simplicity of their definitions and their nice coalgebraic properties. Howev...
David de Frutos-Escrig, Fernando Rosa Velardo, Car...
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
14 years 3 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
14 years 2 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu