20 search results - page 2 / 4 » Back-Forth Equivalences for Design of Concurrent Systems |
SOSP
2007
ACM
14 years 1 months ago
2007
ACM
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
SEFM
2006
IEEE
13 years 10 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
TCAD
2010
12 years 11 months ago
2010
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...