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.

/pdf/mcmas-a-model-checker-for-the-verification-of-multi-agent-11wqnfwtma.pdf

MCMAS: A Model Checker for the Verification of Multi-Agent Systems

We study the reachability problem for systems implemented as feed-forward neural networks whose activation function is implemented via ReLU functions. We draw a correspondence between establishing whether some arbitrary output can ever be outputed by a neural system and linear problems characterising a neural system of interest. We present a methodology to solve cases of practical interest by means of a state-of-the-art linear programs solver. We evaluate the technique presented by discussing the experimental results obtained by analysing reachability properties for a number of benchmarks in the literature.

An approach to reachability analysis for feed-forward ReLU neural networks.

Thank you very much for downloading service oriented architecture concepts technology and design. Maybe you have knowledge that, people have look hundreds times for their favorite books like this service oriented architecture concepts technology and design, but end up in malicious downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they cope with some harmful virus inside their laptop.

Service Oriented Architecture Concepts Technology And Design

Recently, opacity has proved a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of opacity to the model of labelled transition systems and generalise opacity in order to better represent concepts from the literature on information flow. In particular, we establish links between opacity and the information flow concepts of anonymity and non-inference. We also investigate ways of verifying opacity when working with Petri nets. Our work is illustrated by two examples, one describing anonymity in a commercial context, and the other modelling requirements upon a simple voting system.

/pdf/opacity-generalised-to-transition-systems-3m2eeo7gm9.pdf

Opacity generalised to transition systems

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.

/pdf/mcmas-an-open-source-model-checker-for-the-verification-of-4vixm3awd0.pdf

MCMAS: an open-source model checker for the verification of multi-agent systems

The papers presents the current stage of the development of VerICS - a model checker for real-time and multi-agent systems. Depending on the type of a system considered, it enables to test various classes of properties - from reachability to temporal, epistemic and deontic formulas. The model checking methods used to this aim include both SAT-based and enumerative ones. In the paper we focus on new features of the verifier: SAT-based model checking for multi-agent systems and several extensions and improvements to real-time systems' verification.

/pdf/verics-2007-a-model-checker-for-knowledge-and-real-time-2irb2ziujn.pdf

VerICS 2007 - a Model Checker for Knowledge and Real-Time

We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity requirements specified. Two different model checking techniques (ordered binary decision diagrams and SAT-based bounded model checking) are evaluated and compared to verify the protocols.

/pdf/comparing-bdd-and-sat-based-techniques-for-model-checking-5cock7jy0i.pdf

Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

VerICS is a model checking tool for verication of timed and multi-agent systems. These systems can be represented by timed au- tomata (TA), time Petri nets (TPNs), or given as Estelle and Interme- diate Language specications. VerICS oers three verication methods: Bounded Model Checking (BMC), Unbounded Model Checking (UMC) and Splitting for properties to be specied in subsets of TCTL and CTLpK. The current version of VerICS uses also a new graphical user interface to design time Petri nets and timed automata.

VerICS 2004: A Model Checker for Real Time and Multi-agent Systems ?

The paper presents a prototype toolset to planning by automatic composition of web services. The main idea consists in arranging the composition into two main phases: abstract and concrete one, as well as to handle fully declarative user queries. The first abstract stage aims at finding all the possible sequences of the types of the services that can potentially satisfy the user request. The result, referred to as an abstract plan, is used in the concrete planning phase, which substitutes the types of the services with their concrete instances registered in the system. This is obtained by translating the problem of finding a composition of concrete services satisfying the user query into the reachability problem for (timed) automata with discrete data and parametric assignments, taking into account the concrete instances of services as well as the user query. Next, SAT-based parametric bounded model checking is used to obtaining the solutions in form of sequences of services invocations together with the example services' input values.

PlanICS - a Web Service Composition Toolset

The paper presents a new approach to model checking of systems specified in UML. All the executions of an UML system (unfolded to a given depth) are encoded directly into a boolean propositional formula, satisfiability of which is checked using a SAT-solver. Contrary to other UML verification tools we do not use any of the existing model checkers as we do not translate UML specifications into an intermediate formalism. The method has been implemented as the (prototype) tool BMC4UML and some experimental results are presented.

Artur Niewiadomski

Papers

VerICS 2007 - a Model Checker for Knowledge and Real-Time

Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

VerICS 2004: A Model Checker for Real Time and Multi-agent Systems ?

PlanICS - a Web Service Composition Toolset

A New Approach to Model Checking of UML State Machines