The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a ty...
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...