Author
Franco Raimondi
Other affiliations: University College London, King's College London
Bio: Franco Raimondi is an academic researcher from Middlesex University. The author has contributed to research in topics: Model checking & Temporal logic. The author has an hindex of 24, co-authored 103 publications receiving 2632 citations. Previous affiliations of Franco Raimondi include University College London & King's College London.
Papers published on a yearly basis
Papers
More filters
23 Jun 2009
TL;DR: In this article, a specification language based on epistemic logic for knowledge has been proposed to express security specifications involving anonymity in epistemic formalisms as they explicitly state the lack of different kinds of knowledge of the principals.
Abstract: While temporal logic in its various forms has proven essential to reason about reactive systems, agent-based scenarios are typically specified by considering high-level agents attitudes. In particular, specification languages based on epistemic logic [7], or logics for knowledge, have proven useful in a variety of areas including robotics, security protocols, web-services, etc. For example, security specifications involving anonymity [4] are known to be naturally expressible in epistemic formalisms as they explicitly state the lack of different kinds of knowledge of the principals.
362 citations
TL;DR: The underlying semantics of the specification language supported and the algorithms implemented in MCMAS, including its fairness and counterexample generation features, are presented and a detailed description of the implementation is provided.
Abstract: We present MCMAS, a model checker for the verification of multi-agent systems. MCMAS supports efficient symbolic techniques for the verification of multi-agent systems against specifications representing temporal, epistemic and strategic properties. We present the underlying semantics of the specification language supported and the algorithms implemented in MCMAS, including its fairness and counterexample generation features. We provide a detailed description of the implementation. We illustrate its use by discussing a number of examples and evaluate its performance by comparing it against other model checkers for multi-agent systems on a common case study.
208 citations
09 Nov 2008
TL;DR: In this article, the authors present an implementation to derive on-line monitors for web services automatically from SLAs using an Eclipse plugin, and evaluate the efficiency and scalability of this approach using a large-scale case study in a service-oriented computational grid.
Abstract: If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risks by associating penalty payments with poor service quality. Once these agreements are entered into, it becomes necessary to monitor their conditions, which will commonly relate to timeliness, reliability and request throughput, at run-time. We show how these conditions can be translated into timed automata. Acceptance of a timed word by a timed automaton can be decided in quadratic time and because the timed automata can operate while messages are exchanged at run-time there is effectively only a linear run-time overhead. We present an implementation to derive on-line monitors for web services automatically from SLAs using an Eclipse plugin. We evaluate the efficiency and scalability of this approach using a large-scale case study in a service-oriented computational grid.
161 citations
Journal Article•
TL;DR: This paper presents mcmas, a model checker for Multi-Agent Systems that permits the automatic verification of specifications that use epistemic, correctness, and cooperation modalities, in addition to the standard temporal modalities.
Abstract: This paper presents mcmas, a model checker for Multi-Agent Systems (MAS). Differently from traditional model checkers, mcmas permits the automatic verification of specifications that use epistemic, correctness, and cooperation modalities, in addition to the standard temporal modalities. These additional modalities are used to capture properties of various scenarios (including communication and security protocols, games, etc.) that may be difficult or unnatural to express with temporal operators only; a small number of applications are presented in Section[4]. Agents are described in mcmas by means of the dedicated programming language ISPL (Interpreted Systems Programming Language). The approach is symbolic and uses ordered binary decision diagrams (obdds), thereby extending standard techniques for temporal logic to other modalities distinctive of agents. mcmas and all the examples presented in this paper are available for download [14] under the terms of the GPL license.
147 citations
25 Mar 2006
TL;DR: Mcmas as discussed by the authors is a model checker for multi-agent systems that allows automatic verification of specifications that use epistemic, correctness, and cooperation modalities, in addition to the standard temporal modalities.
Abstract: This paper presents mcmas, a model checker for Multi-Agent Systems (MAS). Differently from traditional model checkers, mcmas permits the automatic verification of specifications that use epistemic, correctness, and cooperation modalities, in addition to the standard temporal modalities. These additional modalities are used to capture properties of various scenarios (including communication and security protocols, games, etc.) that may be difficult or unnatural to express with temporal operators only; a small number of applications are presented in Section[4]. Agents are described in mcmas by means of the dedicated programming language ISPL (Interpreted Systems Programming Language). The approach is symbolic and uses ordered binary decision diagrams (obdds), thereby extending standard techniques for temporal logic to other modalities distinctive of agents. mcmas and all the examples presented in this paper are available for download [14] under the terms of the GPL license.
147 citations
Cited by
More filters
Journal Article•
4,902 citations
01 Jan 2009
TL;DR: This paper presents a meta-modelling framework for modeling and testing the robustness of the modeled systems and some of the techniques used in this framework have been developed and tested in the field.
Abstract: ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of
1,687 citations
TL;DR: The Limits of Organization as discussed by the authors is a seminal work in the field of economic analysis and policy making, focusing on the role of organization in economic decision-making, and its effect on economic outcomes.
Abstract: (1975). The Limits of Organization. Journal of Economic Issues: Vol. 9, No. 3, pp. 543-544.
1,138 citations