Sciweavers

ICALP
2010
Springer
13 years 9 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
ICALP
2010
Springer
13 years 9 months ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen
ICALP
2010
Springer
13 years 9 months ago
On Bisimilarity and Substitution in Presence of Replication
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...
Daniel Hirschkoff, Damien Pous
ICALP
2010
Springer
13 years 9 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
ICALP
2010
Springer
13 years 9 months ago
Pebble Weighted Automata and Transitive Closure Logics
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Ma...
ICALP
2010
Springer
13 years 9 months ago
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
ICALP
2010
Springer
13 years 9 months ago
Compositional Closure for Bayes Risk in Probabilistic Noninterference
We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compo...
Annabelle McIver, Larissa Meinicke, Carroll Morgan
ICALP
2010
Springer
13 years 9 months ago
On p-Optimal Proof Systems and Logics for PTIME
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
Yijia Chen, Jörg Flum