33 search results - page 3 / 7 » A Complete Axiomatic Semantics for the CSP Stable-Failures M... |
ENTCS
2006
13 years 8 months ago
2006
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operato...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
KR
2010
Springer
14 years 1 months ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
TCS
2010
13 years 7 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
ENTCS
2006
13 years 8 months ago
2006
In this paper, we present a semantical approach to multi-agent belief revision and belief update. For this, we introduce relational structures called conditional doxastic models (...