Sciweavers

GC
2004
Springer
14 years 2 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
GC
2004
Springer
14 years 2 months ago
A Software Framework for Rapid Prototyping of Run-Time Systems for Mobile Calculi
We describe the architecture and the implementation of the MIKADO software framework, that we call IMC (Implementing Mobile Calculi). The framework aims at providing the programmer...
Lorenzo Bettini, Rocco De Nicola, Daniele Falassi,...
GC
2004
Springer
14 years 2 months ago
Symbolic Equivalences for Open Systems
Abstract. Behavioural equivalences on open systems are usually defined by comparing system behaviour in all environments. Due to this “universal” quantification over the poss...
Paolo Baldan, Andrea Bracciali, Roberto Bruni
GC
2004
Springer
14 years 2 months ago
A Physics-Style Approach to Scalability of Distributed systems
Abstract. Is it possible to treat large scale distributed systems as physical systems? The importance of that question stems from the fact that the behavior of many P2P systems is ...
Erik Aurell, Sameh El-Ansary
GC
2004
Springer
14 years 2 months ago
A Framework for Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participat...
Luc Onana Alima, Ali Ghodsi, Seif Haridi
FOSSACS
2004
Springer
14 years 2 months ago
Electoral Systems in Ambient Calculi
This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calcul...
Iain Phillips, Maria Grazia Vigliotti
FOSSACS
2004
Springer
14 years 2 months ago
Duality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
Michael W. Mislove, Joël Ouaknine, Dusko Pavl...
FOSSACS
2004
Springer
14 years 2 months ago
On Term Rewriting Systems Having a Rational Derivation
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
Antoine Meyer
FOSSACS
2004
Springer
14 years 2 months ago
On Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
Oded Maler, Amir Pnueli
FOSSACS
2004
Springer
14 years 2 months ago
Perfect-Information Stochastic Parity Games
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
Wieslaw Zielonka