@article {Dix07, title = {Temporal Logics of Knowledge and their Applications in Security}, journal = {First Workshop in Information and Computer Security (ICS{\textquoteright}06)}, volume = {186}, year = {2007}, pages = {27-42}, publisher = {Elsevier}, address = {Timisoara, Romania}, abstract = {

\ Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over time. Here we investigate the application of temporal logics of knowledge to the specification and verification of security protocols. We show how typical assumptions relating to authentication protocols can be specified. We consider verification methods for these logics, in particular, focusing on proofs using clausal resolution. Finally we present experiences from using a resolution based theorem prover applied to security protocols specified in temporal logics of knowledge.

}, keywords = {security, temporal resolution}, issn = {1571-0661}, doi = {"DOI: 10.1016/j.entcs.2006.11.043"}, author = {Clare Dixon and Carmen Fernandez-Gago and Michale Fisher and Wiebe van der Hoek} } @article {Winfield2005, title = {On the Formal Specification of Emergent Behaviours of Swarm Robotics Systems}, journal = {International Journal of Advanced Robotics Systems}, volume = {2}, year = {2005}, pages = {363-371}, publisher = {SAGE Publishing}, abstract = {

It is a characteristic of swarm robotics that specifying overall emergent swarm behaviours in terms of the low-level behaviours of individual robots is very difficult. Yet if swarm robotics is to make the transition from the laboratory to real-world engineering realisation we need such specifications. This paper explores the use of temporal logic to formally specify, and possibly also prove, the emergent behaviours of a robotic swarm. The paper makes use of a simplified wireless connected swarm as a case study with which to illustrate the approach. Such a formal approach could be an important step toward a disciplined design methodology for swarm robotics.

}, keywords = {Swarm Robotics, temporal resolution}, issn = {1729-8806}, doi = {dx.doi.org/10.5772/5769}, author = {Alan Winfield and Jin Sa and Carmen Fernandez-Gago and Clare Dixon and Michale Fisher} } @inproceedings {Dix04, title = {Using Temporal Logics of Knowledge in the Formal Verification of Security Protocols}, booktitle = {11th International Symposium on Temporal Representation and Reasoning (TIME{\textquoteright}04)}, year = {2004}, pages = {148-151}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Tatihou, Normandie, France}, abstract = {

Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over time. Here we use temporal logics of knowledge to reason about security protocols. We show how to specify part of the Needham-Schroeder protocol using temporal logics of knowledge and prove various properties using a clausal resolution calculus for this logic.

}, keywords = {security protocols, temporal resolution, verification}, issn = {1530-1311}, doi = {http://doi.ieeecomputersociety.org/10.1109/TIME.2004.1314432}, author = {Clare Dixon and Carmen Fernandez-Gago and Michale Fisher and Wiebe van der Hoek} } @inproceedings {Fernandez02, title = {Algorithms for Guiding Clausal Temporal Resolution}, booktitle = {25th Conference on Artificial Intelligence (KI{\textquoteright}02)}, series = {LNAI}, volume = {2479}, year = {2002}, month = {September}, pages = {235-249}, publisher = {Springer}, organization = {Springer}, address = {Aachen, Germany}, abstract = {

Clausal temporal resolution is characterised by a translation of the formulae whose satisfiability is to be established to a normal form, step resolution (similar to classical resolution) on formulae occurring at the same states and temporal resolution between formulae describing properties over a longer period. The most complex part of the method occurs in searching for candidates for the temporal resolution operation, something that may need to be carried out several times. In this paper we consider a new technique for finding the candidates for the temporal resolution operation. Although related to the previously developed external search procedure, this new approach not only allows the temporal resolution operation to be carried out at any moment, but also simplifies any subsequent search required for similar temporal formulae. Finally, in contrast with previous approaches, this search can be seen as an inherent part of the resolution process, rather than an external procedure that is only called in certain situations.} year = {2002

}, keywords = {Temporal logic, temporal resolution}, author = {Carmen Fernandez-Gago and Michale Fisher and Clare Dixon} }