Sciweavers

ICALP
2010
Springer
14 years 15 days 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
14 years 15 days 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
14 years 15 days 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
ICALP
2010
Springer
14 years 15 days ago
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor W...
ICALP
2010
Springer
14 years 15 days ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
ICALP
2010
Springer
14 years 15 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
ICALP
2010
Springer
14 years 15 days ago
Model Checking Succinct and Parametric One-Counter Automata
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
Stefan Göller, Christoph Haase, Joël Oua...
ICALP
2010
Springer
14 years 15 days ago
The Downward-Closure of Petri Net Languages
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
Peter Habermehl, Roland Meyer, Harro Wimmel
ICALP
2010
Springer
14 years 15 days ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj
ICALP
2010
Springer
14 years 15 days ago
The Serializability of Network Codes
Anna Blasiak, Robert D. Kleinberg