[图书][B] Introduction to bisimulation and coinduction

D Sangiorgi - 2011 - books.google.com
Induction is a pervasive tool in computer science and mathematics for defining objects and
reasoning on them. Coinduction is the dual of induction and as such it brings in quite …

A contextual semantics for Concurrent Haskell with futures

D Sabel, M Schmidt-Schauß - Proceedings of the 13th international ACM …, 2011 - dl.acm.org
In this paper we analyze the semantics of a higher-order functional language with
concurrent threads, monadic IO and synchronizing variables as in Concurrent Haskell. To …

Fair subtyping for multi-party session types

L Padovani - … Conference on Coordination Languages and Models, 2011 - Springer
The standard subtyping relation used in dyadic session type theories may compromise the
liveness of multi-party sessions. In this paper we define a fair subtyping relation for multi …

Innocent strategies as presheaves and interactive equivalences for CCS (expanded version)

T Hirschowitz, D Pous - arXiv preprint arXiv:1109.4356, 2011 - arxiv.org
Seeking a general framework for reasoning about and comparing programming languages,
we derive a new view of Milner's CCS. We construct a category E of'plays', and a …

A state-based characterisation of the conflict preorder

S Ware, R Malik - arXiv preprint arXiv:1108.0230, 2011 - arxiv.org
This paper proposes a way to effectively compare the potential of processes to cause
conflict. In discrete event systems theory, two concurrent systems are said to be in conflict if …

A Testing Framework for P Systems

R Barbuti, DR Cacciagrano… - arXiv preprint arXiv …, 2011 - arxiv.org
Testing equivalence was originally defined by De Nicola and Hennessy in a process
algebraic setting (CCS) with the aim of defining an equivalence relation between processes …

[引用][C] Axioms for computation

Y Fu - 2011 - Working paper