Sciweavers

246 search results - page 31 / 50
» A Proof System for Asynchronously Communicating Deterministi...
Sort
View
IFIP
2004
Springer
14 years 28 days ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 2 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
SPAA
2010
ACM
14 years 11 days ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
FIW
2003
115views Communications» more  FIW 2003»
13 years 9 months ago
Generalising Feature Interactions in Email
We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall’s email model [12] presented at FIW’00 [3]...
Muffy Calder, Alice Miller
SIROCCO
2010
13 years 9 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...