Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes

DOI10.1007/978-3-540-70583-3_9zbMath1155.68472OpenAlexW2133307747MaRDI QIDQ3519494

Martin Berger, Kohei Honda, Nobuko Yoshida

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_9

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Unnamed Item ⋮ An observationally complete program logic for imperative higher-order functions

Uses Software

• SLMC

This page was built for publication: Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes