Verifying social expectations by model checking truncated paths
Cranefield, Stephen; Winikoff, Michael
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectations, together with infrastructure supporting conformance checking. This paper presents a logical account of the fulfilment and violation of social expectations modelled as conditional rules over a hybrid linear propositional temporal logic. Our semantics captures the intuition that the fulfilment or violation of an expectation must be determined without recourse to information from later states. We define a means of updating expectations from one state to the next based on formula progression, and show how conformance checking was implemented by combining the MCFULL model checking algorithm of Franceschet and de Rijke and the semantics for LTL over truncated paths proposed by Eisner et al. We present algorithms for both traditional offline model checking, where the complete model is available at once, and online model checking, where states are added to the model sequentially at run-time.
Publisher: University of Otago
Keywords: social expectations; model checking; multi-agent systems
Research Type: Journal Article
This is a pre-copy-editing, author-produced PDF of an article accepted for publication in the Journal of Logic and Computation following peer review. Free access to the definitive publisher-authenticated version (Stephen Cranefield and Michael Winikoff, Verifying social expectations by model checking truncated paths, J Logic Computation, 21 (6): 1217-1256, 2011) is available via this link: (Please copy and paste into web browser) http://logcom.oxfordjournals.org/content/early/2010/10/27/logcom.exq055.full.pdf?ijkey=LvGK8L9zt9j9IWv&keytype=ref