3,336 research outputs found
Precongruence Formats with Lookahead through Modal Decomposition
Full text linkBloom, 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
LIPIcs, Volume 140, CONCUR'19, Complete Volume
No full textLIPIcs, Volume 140, CONCUR'19, Complete Volum
Robust SOS Specifications of Probabilistic Processes
Full text linkFokkink, W.J. [Promotor]D'Argenio, P.R. [Copromotor
Verification Techniques for Extensions of Equality Logic
Full text linkFokkink, W.J. [Promotor]Pol, J.C. van de [Copromotor
Formal Modeling and Analysis of Mobile Ad hoc Networks
Full text linkFokkink, W.J. [Promotor]Luttik, S.P. [Copromotor
Modal Abstraction and Replication of Processes with Data
Full text linkFokkink, W.J. [Promotor]Pol, J.C. van de [Copromotor
Keeping Fairness Alive : Design and formal verification of optimistic fair exchange protocols
Full text linkFokkink, W.J. [Promotor]Pol, J.C. van de [Promotor
- …
