Sciweavers

71 search results - page 2 / 15
» Complete Cuboidal Sets in Axiomatic Domain Theory
Sort
View
LICS
2000
IEEE
13 years 9 months ago
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
Alex K. Simpson, Gordon D. Plotkin
IPL
2008
84views more  IPL 2008»
13 years 5 months ago
The equational theory of prebisimilarity over basic CCS with divergence
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
Luca Aceto, Silvio Capobianco, Anna Ingólfs...
FAC
1998
111views more  FAC 1998»
13 years 4 months ago
A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
Henri Korver, M. P. A. Sellink
JMIV
1998
93views more  JMIV 1998»
13 years 4 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
TCS
2010
13 years 3 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink