Games for bisimulations and abstraction

DOI10.23638/LMCS-13(4:15)2017zbMATH Open1398.68362arXiv1611.00401MaRDI QIDQ4596797FDOQ4596797

Authors: David de Frutos Escrig, Jeroen J. A. Keiren, T. A. C. Willemse 

Publication date: 11 December 2017

Full work available at URL: https://arxiv.org/abs/1611.00401

Recommendations

• Branching bisimulation games
• scientific article; zbMATH DE number 3898224
• scientific article; zbMATH DE number 794261
• scientific article; zbMATH DE number 1670498
• Publication:4942026

zbMATH Keywords

semanticsconcurrencyreasoningalgorithmic game theory

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizing contrasimilarity through games, modal logic, and complexity
• A game characterization for contrasimilarity
• Branching bisimulation games
• A game for linear-time-branching-time spectroscopy
• Game equivalence and expressive power of game description languages: a bisimulation approach

This page was built for publication: Games for bisimulations and abstraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596797)