7109 search results - page 228 / 1422 » Process Algebra with Combinators |
137
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
156
click to vote
JCT
2010
14 years 11 months ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
131
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
126
click to vote
FOSSACS
2004
Springer
15 years 8 months ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
122
click to vote
FOSSACS
2006
Springer
15 years 8 months ago
2006
Springer
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...