520 search results - page 33 / 104 » An Algebraic Semantics for MOF |
ENTCS
2006
13 years 8 months ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
ICDE
1994
IEEE
14 years 26 days ago
1994
IEEE
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
ICALP
2005
Springer
14 years 2 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...
TCS
2010
13 years 3 months ago
2010
The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on st...
FOSSACS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeter...