Sciweavers

11 search results - page 1 / 3
» Partiality I: Embedding relation algebras
Sort
View
JLP
2006
98views more  JLP 2006»
13 years 4 months ago
Partiality I: Embedding relation algebras
As long as no cooperation between processes is supposed to take place, one may consider them separately and need not ask for the progress of the respective other processes. If a c...
Gunther Schmidt
JSYML
2008
112views more  JSYML 2008»
13 years 4 months ago
On the structure of the Medvedev lattice
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite B...
Sebastiaan Terwijn
AI
2008
Springer
13 years 4 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
BIRTHDAY
2000
Springer
13 years 9 months ago
Discrete time process algebra with silent step
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Renie...
CADE
1998
Springer
13 years 8 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary