Reasoning about knowledge
Model checking
Introduction to Multiagent Systems
Introduction to Multiagent Systems
NUSMV: A New Symbolic Model Verifier
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Automated Model Checking and Testing for Composite Web Services
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Towards verifying compliance in agent-based web service compositions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Verifying Temporal and Epistemic Properties of Web Service Compositions
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Software verification with BLAST
SPIN'03 Proceedings of the 10th international conference on Model checking software
Towards a formal verification of OWL-S process models
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A comparative evaluation of state-of-the-art web service composition testing approaches
Proceedings of the 6th International Workshop on Automation of Software Test
Hi-index | 0.00 |
In this paper we investigate the transformation of OWL-S process models to ISPL - the system description language for MCMAS, a symbolic model checker for multi agent systems. We take the view that services can be considered as agents and service compositions as multi agent systems. We illustrate how atomic and composite processes in OWL-S can be encoded into ISPL using the proposed transformation rules for a restricted set of data types. As an illustrative example, we use an extended version of the BravoAir process model. We formalise certain interesting properties of the example in temporal-epistemic logic and present results from their verification using MCMAS.