Propositional Dynamic Logic for Message-Passing Systems

DOI10.1007/978-3-540-77050-3_25zbMath1135.03335arXiv1007.4764OpenAlexW1974771355MaRDI QIDQ5458843

Benedikt Bollig, Ingmar Meinecke, Dietrich Kuske

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Propositional Dynamic Logic for Message-Passing Systems, A logic framework for reasoning with movement based on fuzzy qualitative representation

Cites Work

• Muller message-passing automata and logics
• Propositional dynamic logic of regular programs
• Dynamic linear time temporal logic
• Reasoning about layered message passing systems
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• Message-passing automata are expressively equivalent to EMSO logic
• On Communicating Finite-State Machines
• Propositional Dynamic Logic for Message-Passing Systems
• CONCUR 2003 - Concurrency Theory
• A product version of dynamic linear time temporal logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item