Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixp...
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
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...