Sciweavers

48 search results - page 1 / 10
» A Logical Characterisation of Static Equivalence
Sort
View
ENTCS
2007
116views more  ENTCS 2007»
13 years 5 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
APAL
2008
87views more  APAL 2008»
13 years 5 months ago
Characterising nested database dependencies by fragments of propositional logic
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
Sven Hartmann, Sebastian Link
TCS
2002
13 years 4 months ago
Monadic second-order logic on tree-like structures
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
Igor Walukiewicz
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 5 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
LICS
2005
IEEE
13 years 11 months ago
Modal Characterisation Theorems over Special Classes of Frames
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...
Anuj Dawar, Martin Otto