Verifying realizability and reachability in recursive interaction protocol specifications

Authors:
Hywel Dunn-Davies;Jim Cunningham
Affiliations:
Imperial College London, London, UK;Imperial College London, London, UK
Venue:
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Year:
2009

Citing 5
Cited 0

On Communicating Finite-State Machines

Journal of the ACM (JACM)
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Deriving agent-centred representations of protocols described using propositional statecharts

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
On the enactability of business protocols

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Modularity and composition in propositional statecharts

Diagrams'06 Proceedings of the 4th international conference on Diagrammatic Representation and Inference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Propositional Statechart language described in [4] makes it possible to provide unambiguous joint diagrammatic specifications of complex recursive interaction protocols such as the multilateral voting protocol. Recursive protocols described using Propositional Statecharts are not necessarily finite state, meaning that verification of properties of these protocols cannot be achieved solely by means of finite state model checking. In this paper we discuss the verification of realizability, and reachability analysis, in recursive joint protocol specifications expressed using joint Propositional Statecharts.