Sciweavers

852 search results - page 62 / 171
» entcs 2010
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
14 years 11 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
74
Voted
ENTCS
2006
138views more  ENTCS 2006»
14 years 11 months ago
Model Checking Russian Cards
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
Hans P. van Ditmarsch, Wiebe van der Hoek, Ron van...
ENTCS
2006
120views more  ENTCS 2006»
14 years 11 months ago
SCHOOL: a Small Chorded Object-Oriented Language
Chords are a declarative synchronisation construct based on the Join-Calculus, available in the programming language C. To our knowledge, chords have no formal model in an object-...
Sophia Drossopoulou, Alexis Petrounias, Alex Buckl...
ENTCS
2006
192views more  ENTCS 2006»
14 years 11 months ago
Model Transformation From VisualOCL to OCL Using Graph Transformation
In this paper we present a model transformation from a visual representation (VisualOCL) of the Object Constraint Language (OCL) to the textual one using graph transformation. Sta...
Karsten Ehrig, Jessica Winkelmann
ENTCS
2006
136views more  ENTCS 2006»
14 years 11 months ago
Priestley Duality for Strong Proximity Lattices
In 1937 Marshall Stone extended his celebrated representation theorem for Boolean algebras to distributive lattices. In modern terminology, the representing topological spaces are...
Mohamed A. El-Zawawy, Achim Jung