- Full text PDF available (190)
- This year (7)
- Last five years (44)
Data Set Used
This article presents a congruence format, in structural operational semantics , for rooted branching bisimulation equivalence. The format imposes additional requirements of Groote's ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises.
Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial view of the global system. Because of the size of these networks, analysis of gossip protocols is mostly done using simulation, which tend to be expensive in computation time and… (More)
Groote and Vaandrager introduced the tyftttyxt format for Transition System Speciications TSSs, and established that for each TSS in this format that is well-founded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyftttyxt format an equivalent TSS that consists of tree rules only. As a corollary we can… (More)
We set up a formal framework to describe transition system speciications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechanisms and substitutions, among other notions such as negative hypotheses and unary predicates on terms. The framework is used to present a conservativity format in operational… (More)
This paper contributes to the study of the equational theory of the semantics in van Glabbeek's linear time-branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behav-ioral… (More)
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behavior of a term-rewriting system can be improved. Some transformations of rewrite rules enable an implementation using the same primitives as an implementation of eager rewriting.
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS.
An extension of a structural definition of an operational semantics is (operationally) conservative if it does not affect the semantics of terms over the original signature. We present a survey of syntactic formats that have been developed to guarantee that such an extension is conservative. We also give an overview of properties, in the realm of equational… (More)