We provide a uniform solution to the problem of synthesizing a ļ¬nite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this,...
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemā...
Games played on graphs may have qualitative objectives, such as the satisfaction of an Ļ-regular property, or quantitative objectives, such as the optimization of a realvalued re...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...
We show how to give a coherent semantics to programs that are well-speciļ¬ed in a version of separation logic for a language with higher types: idealized algol extended with heap...
We introduce the language QML, a functional language for quantum computations on ļ¬nite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of ļ¬rstorder (FO) and monadic ...