Propositional dynamic logic with converse and repeat for message-passing systems

DOI10.2168/LMCS-9(2:12)2013MaRDI QIDQ5891071zbMATH OpenOpenAlexFDO

Authors 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

propositional dynamic logicalternating automatamessage sequence chartscommunicating finite-state machines

Mathematics Subject Classification ID

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

Recommendations

• Propositional dynamic logic with converse and repeat for message-passing systems
• Propositional dynamic logic for message-passing systems
• Propositional Dynamic Logic for Message-Passing Systems
• Infinite State Model-Checking of Propositional Dynamic Logics
• Model checking propositional dynamic logic with all extras

Cited in

(9)

• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
• Propositional dynamic logic for message-passing systems
• CONCUR 2004 - Concurrency Theory
• Propositional Dynamic Logic for Message-Passing Systems
• scientific article; zbMATH DE number 7713505 (Why is no real title available?)
• Temporal logics for concurrent recursive programs: satisfiability and model checking
• Propositional dynamic logic with converse and repeat for message-passing systems
• It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
• An automata-theoretic approach to the verification of distributed algorithms

This page was built for publication: Propositional dynamic logic with converse and repeat for message-passing systems

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