1st Mar 2005 AL3-TF2 - ProMAS TFG1 Shall we Depend on Dependability for Industrial Uptake of Agent Technology? Rafael H. Bordini Department of Computer.

Slides:



Advertisements
Similar presentations
Copyright 2000 Cadence Design Systems. Permission is granted to reproduce without modification. Introduction An overview of formal methods for hardware.
Advertisements

Formal Methods and Testing Goal: software reliability Use software engineering methodologies to develop the code. Use formal methods during code development.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Complexity. P=NP? Who knows? Who cares? Lets revisit some questions from last time – How many pairwise comparisons do I need to do to check if a sequence.
Individual Position Slides: Jonathan Katz (University of Maryland) (Apologies I can’t be here in person)
Aberystwyth University Department of Computer Science 1 Lessons from engineering: Can software benefit from product based evidence of reliability? Neal.
LIFE CYCLE MODELS FORMAL TRANSFORMATION
Department of Computer Science & Engineering
 Assertions: unsupported declaration of a belief  Prejudice: a view without evidence for or against  Premises: explicit evidence that lead to a conclusion.
Section 3.8: More Modular Arithmetic and Public-Key Cryptography
Software Reliability CIS 640 Adapted from the lecture notes by Doron Pelel (
Mehdi Dastani Jorge J. Gomez-Sanz PROMAS PROgramming Multi-Agent Systems.
1 Introduction to Computability Theory Lecture15: Reductions Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Computational problems, algorithms, runtime, hardness
Testing: Who 3, What 4, Why 1, When 2, How 5 Lian Yu, Peking U. Michal Young, U. Oregon.
1 Certification Chapter 14, Storey. 2 Topics  What is certification?  Various forms of certification  The process of system certification (the planning.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
The Theory of NP-Completeness
Analysis of Algorithms CS 477/677
Complexity of Mechanism Design Vincent Conitzer and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
Embedded Systems Laboratory Department of Computer and Information Science Linköping University Sweden Formal Verification and Model Checking Traian Pop.
Recursion Chapter 7. Chapter 7: Recursion2 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method To learn.
School of Computer ScienceG53FSP Formal Specification1 Dr. Rong Qu Introduction to Formal Specification
Project Workshops Results and Evaluation. General The Results section presents the results to demonstrate the performance of the proposed solution. It.
Principle of Functional Verification Chapter 1~3 Presenter : Fu-Ching Yang.
Introduction complexity has been suggested as a means of precluding strategic behavior. Previous studies have shown that some voting protocols are hard.
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
BSBIMN501A QUEENSLAND INTERNATIONAL BUSINESS ACADEMY.
Selected topics in distributed computing Shmuel Zaks
1 CIS 5371 Cryptography 3. Private-Key Encryption and Pseudorandomness B ased on: Jonathan Katz and Yehuda Lindel Introduction to Modern Cryptography.
R. Banach, School of Computer Science, University of Manchester, UK M. Bozzano, Fondazione Bruno Kessler, FBK-IRST, Trento, Italy 11. FSAP and the Model.
Team Skill 6: Building the Right System From Use Cases to Implementation (25)
Software Testing Testing principles. Testing Testing involves operation of a system or application under controlled conditions & evaluating the results.
How to Improve Your Communication of Ideas in an Essay.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 8: Complexity Theory.
Composing Adaptive Software Authors Philip K. McKinley, Seyed Masoud Sadjadi, Eric P. Kasten, Betty H.C. Cheng Presented by Ana Rodriguez June 21, 2006.
Workflow Treatment with Coloured Petri Nets Alexandru Cicortaş Diana
Overview of Formal Methods. Topics Introduction and terminology FM and Software Engineering Applications of FM Propositional and Predicate Logic Program.
Ethics of Software Testing Thomas LaToza CS 210 Final Presentation 12 / 2 / 2002.
Science Fair How To Get Started… (
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
ACM SIGACT News Distributed Computing Column 9 Abstract This paper covers the distributed systems issues, concentrating on some problems related to distributed.
Instructor: Shengyu Zhang 1. Tractable While we have introduced many problems with polynomial-time algorithms… …not all problems enjoy fast computation.
Data Structures R e c u r s i o n. Recursive Thinking Recursion is a problem-solving approach that can be used to generate simple solutions to certain.
Fault-Tolerant Parallel and Distributed Computing for Software Engineering Undergraduates Ali Ebnenasir and Jean Mayo {aebnenas, Department.
Section 10.1 Confidence Intervals
Market research for a start-up. LEARNING OUTCOMES By the end of this lesson I will be able to: –Define and explain market research –Distinguish between.
On the Definition of Survivability J. C. Knight and K. J. Sullivan, Department of Computer Science, University of Virginia, December 2000.
CIS 842: Specification and Verification of Reactive Systems Lecture 1: Course Overview Copyright 2001, Matt Dwyer, John Hatcliff, and Radu Iosif. The.
Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Chapter 13: Software Quality Project Management Afnan Albahli.
An Axiomatic Basis for Computer Programming Robert Stewart.
Verification of FT System Using Simulation Petr Grillinger.
1 Hypothesis Testing Basic Problem We are interested in deciding whether some data credits or discredits some “hypothesis” (often a statement about the.
EE694v-Verification-Lect7-1- Verification Plan & Levels of Verification The Verification Plan Yesterdays and today’s design environment Design specification.
Chapter 11 Introduction to Computational Complexity Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
NETW3005 Virtual Memory. Reading For this lecture, you should have read Chapter 9 (Sections 1-7). NETW3005 (Operating Systems) Lecture 08 - Virtual Memory2.
CS 5150 Software Engineering Lecture 22 Reliability 3.
44222: Information Systems Development
On Concurrency Idioms and their Effect on Program Analysis Weizmann Institute of Science Guy Katz and David Harel.
The inference and accuracy We learned how to estimate the probability that the percentage of some subjects in the sample would be in a given interval by.
Testing and Debugging PPT By :Dr. R. Mall.
Albert M. K. Cheng Embedded Real-Time Systems
Problems with IDR Before the holidays we discussed two problems with the indirect realist view. If we can’t perceive the external world directly (because.
Verification Plan & Levels of Verification
NP-completeness The Chinese University of Hong Kong Fall 2008
Rich Model Toolkit – An Infrastructure for Reliable Computer Systems
From Use Cases to Implementation
Constructing a Test We now know what makes a good question:
Presentation transcript:

1st Mar 2005 AL3-TF2 - ProMAS TFG1 Shall we Depend on Dependability for Industrial Uptake of Agent Technology? Rafael H. Bordini Department of Computer Science University of Durham, U.K.

1st Mar 2005 AL3-TF2 - ProMAS TFG2 Dependable Systems As computer systems permeate further our daily life, mankind becomes increasingly dependant on them We need to make sure they do not ever crash, but also make sure they cannot be sabotaged The area of dependable systems brings together work on various aspects of computing such as fault tolerance, cryptography, and formal methods Ultimately, formal verification would give assurance that we can reliably depend on such systems Many of the typical areas of applications for MAS require dependable systems!

1st Mar 2005 AL3-TF2 - ProMAS TFG3 Formal Verification Two main approaches Theorem Proving Model Checking But also direct execution, and various formal approaches are also amenable to some form of verification (logic programming, Petri nets, etc.) Model Checking can be based on a variety of techniques: Automata-Theoretic (explicit state) OBDDs (symbolic model checking) Reduction to SAT (to use existing SAT solvers)

1st Mar 2005 AL3-TF2 - ProMAS TFG4 Model Checking MAS Most of the (still very young!) work on verification of multi-agent systems has focused on Model Checking Some of the reasons for this might be: Easier for end-users than theorem proving Counterexample can be quite useful for debugging Some interesting logics (e.g., ATL) for agent verification have simple (and tractable) model checking algorithms, but very hard to give sound and complete axiomatisations for Some of the researchers who have contributed to the area are: M.Wooldridge, W.van der Hoek, M.Fisher, W.Visser, R.Bordini, A.Lomuscio, V.Panczek, M.Ryan, P.-Y.Schobbens, M.Singh, R.van den Mayden, J.Padget, A.Cimatti, M.Benerecetti, …

1st Mar 2005 AL3-TF2 - ProMAS TFG5 TFG Q1: Is it Easier to Apply Formal Methods to MAS? No! At the moment, probably more difficult (too recent, so not many specific/robust tools available) But arguably MAS techniques are appropriate for the development of certain types of distributed systems and verification techniques tailored specifically for this will be required or at least useful It is still an open question whether some characteristics of multi-agent systems (as a high-level modular approach to developing DS) will allow for particularly successful state-space reduction techniques (the use of such techniques are an essential part of practical model checking), e.g., compositional reasoning

1st Mar 2005 AL3-TF2 - ProMAS TFG6 TFG Q2: What are the Advantages of Applying FM to MAS Developments? As for other systems, formal methods ensure that we can reliably depend on computer systems Verification techniques created specifically for MAS may help development itself (e.g., debugging) and it is possible they will be more efficient for these systems, but we are far from having enough evidence to claim that as yet Ideally, we would have off-the-shelf, verified MAS algorithms, which could significantly decrease development time and at the same facilitating the verification process

1st Mar 2005 AL3-TF2 - ProMAS TFG7 TFG Q3: Are Agents a Better Way of Introducing FM to Industry? Conceivable: If it turns out that MAS techniques indeed facilitate the development of certain kinds of industrial systems that require dependability If we deliver MAS techniques that have been verified or tools that facilitate verification of MAS in a way that is practical/cost-effective enough for Industry Can we be certain that will happen? Not as yet, I think! This is a good discussion point…

1st Mar 2005 AL3-TF2 - ProMAS TFG8 TFG Q4: Will Technological Transfer be Easier due to FM for MAS? Again, that is conceivable: If we manage to deliver formal methods that help in the development process of MAS If it turns out that MAS techniques are particularly suitable for a class of applications which require dependability and we deliver suitable FM Can we be sure that will be the case? Not as yet, I think! In fact, MAS are already making it to Industry for “ordinary” applications – see AgentLink News #16 This too is a good discussion point!

1st Mar 2005 AL3-TF2 - ProMAS TFG9 So, shall we depend on dependability for Industrial Uptake? I do not think we have to depend on FM for MAS and the use of MAS techniques for dependable system for Industrial Uptake In a way, this is happening already, and MAS verification is just starting as a research area But my guess is (although guessing is never good for science): MAS will be particularly suitable for dependable systems, and FM for MAS will result in a major impact on the practical development of such systems