Sciweavers

9 search results - page 2 / 2
» A Compositional Theory of Refinement for Branching Time
Sort
View
FOSSACS
2011
Springer
14 years 3 months ago
Similarity Quotients as Final Coalgebras
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...
Paul Blain Levy
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 3 months ago
Quantum complexity theory
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...
Ethan Bernstein, Umesh V. Vazirani
83
Voted
SAC
2010
ACM
15 years 1 months ago
A heterogeneous approach to service-oriented systems specification
Service-oriented architecture (SOA) is a relatively new approach to software system development. It divides system functionality to independent, loosely coupled, interoperable ser...
Alexander Knapp, Grzegorz Marczynski, Martin Wirsi...
BIRTHDAY
2005
Springer
15 years 5 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...