An Epistemic Predicate CTL* for Finite Control π-Processes

DOI10.1016/J.ENTCS.2011.10.018zbMath1347.68225OpenAlexW2095498627WikidataQ113318186 ScholiaQ113318186MaRDI QIDQ2825420

Dimitar P. Guelev, Mads Dam

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.10.018

zbMATH Keywords

model checkingpi-calculusepistemic temporal logic

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Uses Software

• MCK
• MMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. I
• Model checking mobile processes
• Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
• Alternating-time temporal logic
• Observing Distributed Computation. A Dynamic-Epistemic Approach
• μ-programs, uniform interpolation and bisimulation quantifiers for modal logics ★
• Mobile values, new names, and secure communication
• Computer Aided Verification

This page was built for publication: An Epistemic Predicate CTL* for Finite Control π-Processes