Fair subtyping for open session types
L Padovani - International Colloquium on Automata, Languages …, 2013 - Springer
Fair subtyping is a liveness-preserving refinement relation for session types akin to (but
coarser than) the well-known should-testing precongruence. The behavioral …
coarser than) the well-known should-testing precongruence. The behavioral …
Full abstraction for fair testing in CCS
T Hirschowitz - Algebra and Coalgebra in Computer Science: 5th …, 2013 - Springer
In previous work with Pous, we defined a semantics for CCS which may both be viewed as
an innocent presheaf semantics and as a concurrent game semantics. It is here proved that …
an innocent presheaf semantics and as a concurrent game semantics. It is here proved that …
Compositional verification of the generalized nonblocking property using abstraction and canonical automata
S Ware, R Malik - International Journal of Foundations of Computer …, 2013 - World Scientific
This paper brings together two methods to compositionally verify the generalized non-
blocking property, which is a weak liveness property to express the ability of concurrent …
blocking property, which is a weak liveness property to express the ability of concurrent …
Fully-abstract concurrent games for pi
We define a semantics for Milner's pi-calculus, with three main novelties. First, it provides a
fully-abstract model for fair testing equivalence, whereas previous semantics covered …
fully-abstract model for fair testing equivalence, whereas previous semantics covered …
[PDF][PDF] Characterizing weakly terminating partners of open systems
We study open systems modeled as finite state machines with an interface for asynchronous
communication with other open systems. An open system P is a partner of an open system …
communication with other open systems. An open system P is a partner of an open system …