SPIN is an efficient verification system for models of distributed software systems. It has been used to detect design errors in applications ranging from high-level descriptions of distributed algorithms to detailed code for controlling telephone exchanges. The paper gives an overview of the design and structure of the verifier, reviews its theoretical foundation, and gives an overview of significant practical applications.

/pdf/the-model-checker-spin-1bgo4jtefp.pdf

The model checker SPIN

Explanation in artificial intelligence: Insights from the social sciences

http://emamispnu.persiangig.com/Projects/Cloud%20Computing/science_2.pdf

Review: A survey on security issues in service delivery models of cloud computing

Our goal in this paper is to introduce and motivate a methodology, called Tropos,1 for building agent oriented software systems. Tropos is based on two key ideas. First, the notion of agent and all related mentalistic notions (for instance goals and plans) are used in all phases of software development, from early analysis down to the actual implementation. Second, Tropos covers also the very early phases of requirements analysis, thus allowing for a deeper understanding of the environment where the software must operate, and of the kind of interactions that should occur between software and human agents. The methodology is illustrated with the help of a case study. The Tropos language for conceptual modeling is formalized in a metamodel described with a set of UML class diagrams.

/pdf/tropos-an-agent-oriented-software-development-methodology-4cfpp4zfvj.pdf

Tropos: An Agent-Oriented Software Development Methodology

Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution, and application-level multicast applications. These P2P overlay networks attempt to provide a long list of features, such as: selection of nearby peers, redundant storage, efficient search/location of data items, data permanence or guarantees, hierarchical naming, trust and authentication, and anonymity. P2P networks potentially offer an efficient routing architecture that is self-organizing, massively scalable, and robust in the wide-area, combining fault tolerance, load balancing, and explicit notion of locality. In this article we present a survey and comparison of various Structured and Unstructured P2P overlay networks. We categorize the various schemes into these two groups in the design spectrum, and discuss the application-level network performance of each group.

/pdf/a-survey-and-comparison-of-peer-to-peer-overlay-network-cpcv2ij1hk.pdf

A survey and comparison of peer-to-peer overlay network schemes

It is our great pleasure to welcome you to the 2nd International Conference on Service-Oriented Computing - ICSOC'04. This year's conference, building on the success of the First International Conference on Service-Oriented Computing held in Trento in December 2003, is becoming a well-established and widely recognized event. This is demonstrated not only by the high number of submissions, but also by the quality of the accepted papers that you will find in this volume.

The 2nd International Conference on Service-Oriented Computing is held in New York in November, 2004. We are sure that the skylines of New York will impress all visitors of this vibrant and exciting city. We do hope that this year attendees will take the chance to enjoy a city that offers entertainments for all tastes.

New York is also a city home to many important laboratories and software industries, such as IBM Research Labs, members of which this year have took the burden of organizing the conference. It is here that most of the standards that form the basis of the Service-Oriented Computing (SOC) paradigm were conceived and designed and it is therefore a great pleasure to have the second edition of ICSOC held in New York.

Service-Oriented Computing is rapidly establishing itself as the paradigm for distributed computing and e-business processing. SOC utilizes services as the constructs to support the development of rapid, low-cost and easy composition of distributed applications. Services are self-contained processes - deployed over standard middleware platforms - that can be discovered, composed and invoked through all kinds of networks.

On the research side, fundamental topics in SOC, such as service composition, delivery, discovery, description and integration are covered in this volume together with issues of service design and modeling, reasoning and monitoring, and service architectures. But also timely topics such as service security, quality of service models are investigated. A section on theoretical frameworks also delineates fundamental aspects of services.

The implementation of the SOC paradigm is becoming more and more feasible. The quality of the industrial papers received this year testifies this trend. The industrial papers ranked among the best of the whole conference and it was an easy decision that of moving them to the main proceedings volume. This is a clear sign of the taking off of SOC in industry.

Proceedings of the 2nd international conference on Service oriented computing

Planning by model checking is an approach to planning under uncertainty that deals with nondeterminism, partial observability, and extended goals. Its key idea is to solve planning problems model-theoretically. It is based on the following conventions. • A planning domain is a nondeterministic state-transition system, where an action may lead from the same state to many different states. The planner does not know which of the outcomes will actually take place when the action will be executed.

/pdf/planning-based-on-model-checking-3xj6eeqrol.pdf

Planning Based on Model Checking

The growing number of XML documents leads to the need for appropriate XML querying algorithms which are able to utilize the specific characteristics of XML documents. A labelling scheme is fundamental to processing XML queries efficiently. They are used to determine structural relationships between elements corresponding to query nodes in twig pattern queries (TPQs). This article presents a design and implementation of a new indexing technique which exploits the property of prime numbers to identify Parent-Child (P-C) relationships in TPQs during query evaluation. The Child Prime Label (CPL, for short) approach can be efficiently incorporated within the existing labelling schemes. Here, we propose a novel twig matching algorithm based on the well known TwigStack algorithm [3], which applies the CPL approach and focuses on reducing the overhead of storing useless elements and performing unnecessary join operations. Our performance evaluation demonstrates that the new algorithm significantly outperforms the previous approaches.

Web Information Systems and Technologiesm, 13th International Conference, WEBIST 2017

From 4.2.2007 to 9.2.2007, the Dagstuhl Seminar 07061 ``Autonomous and Adaptive Web Services'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.

https://drops.dagstuhl.de/opus/volltexte/2007/1035/pdf/abstracts_collection.1035.pdf/

07061 Abstracts Collection -- Autonomous and Adaptive Web Services.

The goal of this paper is to describe NALIG, a system able to understand natural language like scene descriptions and to draw automatically the image of the scene on a graphic screen. NALIG is provided with knowledge to perform common sense reasoning about spatial configurations of objects, to derive default conclusions, to detect inconsistency and to modify the internal representation of the scene to preserve consistency.

Paolo Traverso

Papers

Proceedings of the 2nd international conference on Service oriented computing

Planning Based on Model Checking

Web Information Systems and Technologiesm, 13th International Conference, WEBIST 2017

07061 Abstracts Collection -- Autonomous and Adaptive Web Services.

A Knowledge Based System for Automatic 3D Scene Generation