Sciweavers

CONCUR
2005
Springer
13 years 10 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
CONCUR
2005
Springer
13 years 10 months ago
Transactions in RCCS
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtr...
Vincent Danos, Jean Krivine
CONCUR
2005
Springer
13 years 10 months ago
Probabilistic Anonymity
Mohit Bhargava, Catuscia Palamidessi
CONCUR
2005
Springer
13 years 10 months ago
Termination Analysis of Integer Linear Loops
Usually, ranking function synthesis and invariant generation oop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
CONCUR
2005
Springer
13 years 10 months ago
Modal Logics for Timed Control
In this paper we use the timed modal logic Lν to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a ...
Patricia Bouyer, Franck Cassez, François La...
CONCUR
2005
Springer
13 years 10 months ago
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Ahmed Bouajjani, Markus Müller-Olm, Tayssir T...