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

DOI10.2168/LMCS-9(2:12)2013zbMATH Open1297.68171OpenAlexW1967985135MaRDI QIDQ5891071FDOQ5891071

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)

Cited In (6)

• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
• CONCUR 2004 - Concurrency Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Temporal logics for concurrent recursive programs: satisfiability and model checking
• 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)