1788 search results - page 149 / 358 » Model Theory for Process Algebra |
116
Voted
ICNP
2007
IEEE
15 years 10 months ago
2007
IEEE
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
120
Voted
CTCS
1997
Springer
15 years 7 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
109
Voted
CONCUR
1993
Springer
15 years 7 months ago
1993
Springer
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
132
Voted
CASC
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
116
click to vote
WOTUG
2008
15 years 5 months ago
2008
Abstract. We prove the correctness of a two-way sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data trans...