Sciweavers

187
Voted
ICALP
2009
Springer
15 years 11 months ago
Semilinear Program Feasibility
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
188
Voted
ICALP
2009
Springer
15 years 11 months ago
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
Lucia Acciai, Michele Boreale
181
Voted
ICALP
2009
Springer
15 years 11 months ago
Efficient Methods for Selfish Network Design
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
194
Voted
ICALP
2009
Springer
15 years 11 months ago
Boundedness of Monadic Second-Order Formulae over Finite Words
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
Achim Blumensath, Martin Otto, Mark Weyer
198
Voted
ICALP
2009
Springer
16 years 10 days ago
Multiple Random Walks and Interacting Particle Systems
Colin Cooper, Alan M. Frieze, Tomasz Radzik
ICALP
2009
Springer
16 years 10 days ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
198
Voted
ICALP
2009
Springer
16 years 10 days ago
On Observing Dynamic Prioritised Actions in SOC
We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and wea...
Rosario Pugliese, Francesco Tiezzi, Nobuko Yoshida
165
Voted
ICALP
2009
Springer
16 years 10 days ago
Superhighness and Strong Jump Traceability
André Nies
206
Voted
ICALP
2009
Springer
16 years 2 months ago
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
Thomas Colcombet, Konrad Zdanowski
205
Voted
ICALP
2009
Springer
16 years 2 months ago
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
Abstract. We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of...
Rachid Guerraoui, Eric Ruppert