Sciweavers

718 search results - page 68 / 144
» On Defaults in Action Theories
Sort
View
FOSSACS
2004
Springer
15 years 1 months ago
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
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...
Wan Fokkink, Sumit Nain
APAL
2005
117views more  APAL 2005»
14 years 9 months ago
About cut elimination for logics of common knowledge
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
Luca Alberucci, Gerhard Jäger
ACS
2011
14 years 4 months ago
The Patch Construction is Dual to Algebraic DCPO Representation
Using the parallel between the preframe and the suplattice approach to locale theory it is shown that the patch construction, as an action on topologies, is the same thing as the ...
Christopher F. Townsend
ICTAC
2009
Springer
15 years 4 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner
ATAL
2005
Springer
15 years 3 months ago
Dynamic epistemic logic with assignment
We add assignment operators to languages for epistemic actions, so that change of knowledge and change of facts can be combined in specifications of multi-agent system dynamics. ...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...