276 search results - page 18 / 56 » Bisimulation for quantum processes |
95
Voted
CALCO
2009
Springer
15 years 7 months ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
92
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
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 ...
85
Voted
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
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...
102
click to vote
TCS
2008
15 years 11 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...
106
Voted
ENTCS
2011
14 years 7 months ago
2011
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...