Formal semantics of a dynamic epistemic logic for describing knowledge properties of -calculus processes

DOI10.1007/978-3-642-14977-1_8MaRDI QIDQ3582736zbMATH OpenOpenAlexFDO

Authors Pedro Arturo Góngora, Eric Ufferman, Francisco Hernández-Quiroz

Publication date 24 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14977-1_8

Mathematics Subject Classification ID

Cryptography (94A60) Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A complete proof system for a dynamic epistemic logic based upon finite \(\pi\)-calculus processes
• A propositional dynamic logic for concurrent programs based on the \(\pi\)-calculus
• Observing Distributed Computation. A Dynamic-Epistemic Approach
• Dynamic epistemic logic with communication actions
• Spatial and epistemic modalities in constraint-based process calculi

Cites work

• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• A complete proof system for a dynamic epistemic logic based upon finite \(\pi\)-calculus processes
• Dynamic Epistemic Logic and Knowledge Puzzles
• Logics of communication and change
• Merging frameworks for interaction
• Modal logics for mobile processes
• Observing Distributed Computation. A Dynamic-Epistemic Approach
• The \(\pi\)-calculus: A theory of mobile processes
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• The logic of public announcements, common knowledge, and private suspicions

Cited in

(6)

• Trace equivalence and epistemic logic to express security properties
• Agent Environment and Knowledge in Distributed Join Calculus
• An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes
• Epistemic Strategies and Games on Concurrent Processes
• A complete proof system for a dynamic epistemic logic based upon finite \(\pi\)-calculus processes
• Epistemic strategies and games on concurrent processes

This page was built for publication: Formal semantics of a dynamic epistemic logic for describing knowledge properties of \(\pi \)-calculus processes

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