Wojciech Penczek

Learn More
We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem", a typical example of oordination in multi-agent systems.
Find loads of the advances in verification of time petri nets and timed automata a temporal logic approach reprint book catalogues in this site as the choice of you visiting this page. You can also join to the website book library that will show you numerous books from any types. Literature, science, politics, and many more catalogues are presented to offer(More)
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK bounded model checking based on a discretisation method. We exemplify the use of the technique by means of the "Railroad Crossing System", a popular example in the multi-agent(More)
Temporal logic of causal knowledge over general partially ordered structures is deened. The deenition of knowledge captures the change of state due to action executions. The structures are a variant of ow event structures including prime event structures and branching processes of Petri Nets. Modalities corresponding to the causality, independency, and(More)
We analyse different versions of the dining cryptographers protocol by means of automatic verication via model checking. Specically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity requirements specied. Two different model checking techniques (ordered binary decision diagrams and(More)