The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about knowledge
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Synthesis from Knowledge-Based Specifications (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Finite State Implementations of Knowledge-Based Programs
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Synthesizing Processes and Schedulers from Temporal Specifications
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
An Automata-Theoretic Approach to Fair Realizability and Synthesis
Proceedings of the 7th International Conference on Computer Aided Verification
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Synthesis of fault-tolerant concurrent programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
A Landscape with Games in the Background
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Hiding information in multi level security systems
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Asynchronous omega-regular games with partial information
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Asynchronous games over tree architectures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We consider the problem of synthesizing protocols in a distributed setting satisfying specifications phrased in the logic of linear time and knowledge. On the one hand, we show that synthesis is already undecidable in environments with just two agents, one of which observes every aspect of the system state and one of which observes nothing of it. This falsifies a conjecture of van der Meyden and Vardi from CONCUR'96. On the other hand, we prove that synthesis is decidable in broadcast environments, verifying a conjecture of van der Meyden and Vardi from the same paper, and we show that for specifications that are positive in the knowledge modalities the synthesis problem can be reduced to the same problem for formulas without knowledge modalities. After adapting Pnueli and Rosner's decidability result on synthesis for linear temporal logic specifications in hierarchical environments, we obtain that, in our setting, synthesis is decidable for specifications positive in the knowledge modalities when restricted to hierarchical environments. We conclude the decidability in hierarchical systems of a property closely related to nondeducibility on strategies, a notion that has been studied in computer security.