Results 1 - 10 of 1,331

Model Checking Distributed Systems against Temporal-Epistemic Specifications

by Andreas Griesmayer, Alessio Lomuscio
"... Abstract. Concurrency and message reordering are two main causes for the state-explosion in distributed systems with asynchronous communication. We study this domain by analysing ABS, an executable modelling language for object-based distributed systems and present a symbolic model checking methodol ..."
Abstract - Add to MetaCart
methodology for verifying ABS programs against temporal-epistemic specifications. Specifically, we show how to map an ABS program into an ISPL program for verification with MCMAS, a model checker for multi-agent systems. We present a compiler implementing the formal map, exemplify the methodology on a mesh

Symbolic model checking for temporal-epistemic logics

by A. Lomuscio, W. Penczek - ACM SIGACT NEWS , 2007
"... . We survey some of the recent work in verification via symbolic model checking of temporal-epistemic logic. Specifically, we discuss OBDD-based and SAT-based approaches for epistemic logic built on discrete and real-time branching time temporal logic. The underlying semantical model considered thr ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
. We survey some of the recent work in verification via symbolic model checking of temporal-epistemic logic. Specifically, we discuss OBDD-based and SAT-based approaches for epistemic logic built on discrete and real-time branching time temporal logic. The underlying semantical model considered

A Compilation Method for the Verification of Temporal-Epistemic Properties of Cryptographic Protocols

by I. Boureanu, M. Cohen, A. Lomuscio
"... Abstract. We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. Our work is based on model checking multi-agent systems against properties given in AI logics. We present PC2IS, a compiler from CAPSL to ISPL, the input lan ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
Abstract. We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. Our work is based on model checking multi-agent systems against properties given in AI logics. We present PC2IS, a compiler from CAPSL to ISPL, the input

A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic

by Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Qu
"... We introduce a symmetry reduction technique for model checking temporal-epistemic properties of multi-agent systems defined in the mainstream interpreted systems framework. The technique, based on counterpart semantics, aims to reduce the set of initial states that need to be considered in a model. ..."
Abstract - Cited by 14 (7 self) - Add to MetaCart
We introduce a symmetry reduction technique for model checking temporal-epistemic properties of multi-agent systems defined in the mainstream interpreted systems framework. The technique, based on counterpart semantics, aims to reduce the set of initial states that need to be considered in a model

Automatic Verification of Temporal-Epistemic Properties of Cryptographic Protocols

by I. Boureanu, M. Cohen, A. Lomuscio
"... ABSTRACT. We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and rewrite CAPSL goals as temporal-epi ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
ABSTRACT. We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and rewrite CAPSL goals as temporal-epistemic

Model Checking Temporal-Epistemic Logic Using Tree Automata

by Francesco Belardinelli, Andrew V. Jones, Alessio Lomuscio
"... Abstract. We introduce an automata-theoretic approach for the verification of multi-agent systems. We present a translation between branching time temporal-epistemic logic and alternating tree automata. Model checking an interpreted system against a temporal-epistemic formula is reduced to checking ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. We introduce an automata-theoretic approach for the verification of multi-agent systems. We present a translation between branching time temporal-epistemic logic and alternating tree automata. Model checking an interpreted system against a temporal-epistemic formula is reduced to checking

IOS Press Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

by Francesco Belardinelli, Andrew V. Jones, Alessio Lomuscio
"... Abstract. We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating tree automata, an extension of alternating tree automata, and use them to represent specifications in the temporal-epistemic logic CTLK. We show that model checkin ..."
Abstract - Add to MetaCart
Abstract. We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating tree automata, an extension of alternating tree automata, and use them to represent specifications in the temporal-epistemic logic CTLK. We show that model

Bayesian Description Logics. In:

by Franz Baader , Ralf Küsters , Frank Wolter - Proc. of DL’14. CEUR Workshop Proceedings, , 2014
"... Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints; moda ..."
Abstract - Cited by 394 (49 self) - Add to MetaCart
; modal, epistemic, and temporal operators; probabilities and fuzzy logic; and defaults. On the other hand, it considers non-standard inference problems for Description Logics, i.e., inference problems that-unlike subsumption or instance checking-are not available in all systems, but have turned out

The complexity of model checking concurrent programs against CTLK specifications

by Alessio Lomuscio, Franco Raimondi - ACM, 2006. Checking Knowledge and Linear Time: PSPACE Cases 17 , 2006
"... This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying programs by means of two model checkers for multi-agent systems: MCMAS and Verics. ..."
Abstract - Cited by 18 (5 self) - Add to MetaCart
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying programs by means of two model checkers for multi-agent systems: MCMAS and Verics.

PRISM: Probabilistic symbolic model checker

by Marta Kwiatkowska, Gethin Norman, David Parker , 2002
"... Abstract. In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems. PRISM supports two probabilistic models: continuous-time Markov chains and Markov decision processes. Analysis is performed through model checking such systems ..."
Abstract - Cited by 236 (13 self) - Add to MetaCart
such systems against specifications written in the probabilistic temporal logics PCTL and CSL. The tool features three model checking engines: one symbolic, using BDDs (binary decision diagrams) and MTBDDs (multi-terminal BDDs); one based on sparse matrices; and one which combines both symbolic and sparse
Results 1 - 10 of 1,331