159 search results - page 10 / 32 » Weak Equivalences in Psi-Calculi |
99
Voted
CONCUR
1995
Springer
15 years 4 months ago
1995
Springer
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...
87
Voted
AML
2008
15 years 25 days ago
2008
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
128
click to vote
QEST
2007
IEEE
15 years 7 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
103
click to vote
TCS
2008
15 years 18 days ago
2008
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
136
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...