[HTML][HTML] Precise subty** for synchronous multiparty sessions
This paper proves the soundness and completeness, together referred to as preciseness, of
the subty** relation for a synchronous multiparty session calculus. We address …
the subty** relation for a synchronous multiparty session calculus. We address …
Consistently-detecting monitors
A Francalanza - 28th International Conference on Concurrency …, 2017 - drops.dagstuhl.de
We study a contextual definition for deterministic monitoring based on consistent detections.
It is defined in terms of the observed behaviour of the monitor when instrumented over …
It is defined in terms of the observed behaviour of the monitor when instrumented over …
[HTML][HTML] Full-abstraction for client testing preorders
Client testing preorders relate tests (clients) instead of processes (servers), and are usually
defined using either must testing or a compliance relation. Existing characterisations of …
defined using either must testing or a compliance relation. Existing characterisations of …
A coinductive equational characterisation of trace inclusion for regular processes
M Hennessy - Models, Algorithms, Logics and Tools: Essays …, 2017 - Springer
Abstract In 1966 Arto Salomaa gave a complete axiomatisation of regular expressions. It can
be viewed as a sound and complete proof system for regular processes with respect to the …
be viewed as a sound and complete proof system for regular processes with respect to the …
[PDF][PDF] Journal of Logical and Algebraic Methods in Programming
This paper proves the soundness and completeness, together referred to as preciseness, of
the subty** relation for a synchronous multiparty session calculus. We address …
the subty** relation for a synchronous multiparty session calculus. We address …