Transition systems over games

DOI10.1145/2603088.2603150zbMath1401.68231OpenAlexW2168545476MaRDI QIDQ4635649

Sam Staton, Paul Blain Levy

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.675.5088

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ Unnamed Item ⋮ Complete trace models of state and control

This page was built for publication: Transition systems over games