9 search results - page 2 / 2 » A Compositional Theory of Refinement for Branching Time |
105
click to vote
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
71
Voted
SAC
2010
ACM
14 years 11 months ago
2010
ACM
Service-oriented architecture (SOA) is a relatively new approach to software system development. It divides system functionality to independent, loosely coupled, interoperable ser...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...