Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
What processes know: Definitions and proof methods
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Reasoning about knowledge and time in asynchronous systems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Reasoning about knowledge
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Truly Concurrent Model for Interacting Agents
PRIMA 2001 Proceedings of the 4th Pacific Rim International Workshop on Multi-Agents, Intelligent Agents: Specification, Modeling, and Applications
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Operational Semantics for Agent Communication Languages
Issues in Agent Communication
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Towards an Epistemic Approach to Reasoning about Concurrent Programs
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
An epistemic proof system for parallel processes: extended abstract
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
CONCUR 2005 - Concurrency Theory
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
Epistemic Strategies and Games on Concurrent Processes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Aximo: Automated Axiomatic Reasoning for Information Update
Electronic Notes in Theoretical Computer Science (ENTCS)
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Process Algebra: Equational Theories of Communicating Processes
Process Algebra: Equational Theories of Communicating Processes
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Journal of Logic, Language and Information
Decompositional reasoning about the history of parallel processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
Process algebras have been developed as formalisms for specifying the behavioral aspects of protocols. Interpreted systems have been proposed as a semantic model for multi-agent communication. In this paper, we connect these two formalisms by defining an interpreted systems semantics for a generic process algebraic formalism. This allows us to translate and compare the vast body of knowledge and results for each of the two formalisms to the other and perform epistemic reasoning, e.g., using model-checking tools for interpreted systems, on process algebraic specifications. Based on our translation we formulate and prove some results about the interpreted systems generated by process algebraic specifications.