49 research outputs found
Precongruence Formats with Lookahead through Modal Decomposition
Bloom, Fokkink & van Glabbeek (2004) presented a method to decompose formulas from Hennessy-Milner logic with regard to a structural operational semantics specification. A term in the corresponding process algebra satisfies a Hennessy-Milner formula if and only if its subterms satisfy certain formulas, obtained by decomposing the original formula. They used this decomposition method to derive congruence formats in the realm of structural operational semantics. In this paper it is shown how this framework can be extended to specifications that include bounded lookahead in their premises. This extension is used in the derivation of a congruence format for the partial trace preorder
Verifying a sliding window protocol in mCRL
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing 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
Distributed MAP in the SpinJa Model Checker
Spin in Java (SpinJa) is an explicit state model checker for the Promela
modelling language also used by the SPIN model checker. Designed to be
extensible and reusable, the implementation of SpinJa follows a layered
approach in which each new layer extends the functionality of the previous one.
While SpinJa has preliminary support for shared-memory model checking, it did
not yet support distributed-memory model checking. This tool paper presents a
distributed implementation of a maximal accepting predecessors (MAP) search
algorithm on top of SpinJa.Comment: In Proceedings PDMC 2011, arXiv:1111.006