246 search results - page 31 / 50 » A Proof System for Asynchronously Communicating Deterministi... |
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
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...
114
click to vote
PE
2011
Springer
14 years 6 months ago
2011
Springer
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...
103
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
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 ...
FIW
2003
15 years 1 months ago
2003
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]...
108
click to vote
SIROCCO
2010
15 years 1 months ago
2010
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...