PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic
From MaRDI portal
Publication:4635816
DOI10.1109/LICS.2015.40zbMath1395.03016MaRDI QIDQ4635816
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Hennessy-Milner and van Benthem for instantial neighbourhood logic, Model theory of monadic predicate logic with the infinity quantifier, A quantified coalgebraic van Benthem theorem, Unnamed Item