Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems

DOI10.2168/LMCS-9(2:12)2013zbMath1297.68171OpenAlexW1967985135MaRDI QIDQ5891071

Roy Mennicke

Publication date: 9 July 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-9(2:12)2013

zbMATH Keywords

message sequence chartspropositional dynamic logicalternating automatacommunicating finite-state machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Unnamed Item ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ Temporal logics for concurrent recursive programs: satisfiability and model checking

This page was built for publication: Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems