3,766 Hits in 3.6 sec

Bounded Model Checking for Linear Time Temporal-Epistemic Logic *

Artur Męski, Wojciech Penczek, Maciej Szreter
We present a novel approach to the verification of multi-agent systems using bounded model checking for specifications in LTLK, a linear time temporal-epistemic logic.  ...  We provide a symbolic algorithm for the verification of LTLK over models of multi-agent systems and evaluate its implementation against MCK, a competing model checker for knowledge.  ...  In this paper we present a novel approach to verification of MAS by BDD-based bounded model checking for linear time temporal logic extended with the epistemic component (LTLK, also called CKL n [7] )  ... 

Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics [article]

Alessio Lomuscio, Wojciech Penczek
2007 arXiv   pre-print
This article surveys some of the recent work in verification of temporal epistemic logic via symbolic model checking, focusing on OBDD-based and SAT-based approaches for epistemic logics built on discrete  ...  and real-time branching time temporal logics.  ...  Model checking has also been investigated for certain extensions of the temporal-epistemic logics discussed here.  ... 
arXiv:0709.0446v1 fatcat:uu2hztr4szhebmsqpj4bijluym

Symbolic model checking for temporal-epistemic logics

Alessio Lomuscio, Wojciech Penczek
2007 ACM SIGACT News  
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.  ...  We begin here with the basic temporal branching time temporal-epistemic logic.  ... 
doi:10.1145/1324215.1324231 fatcat:eyfpocebrnauhi3pv5kzerxm4m

Tableaux-Based Decision Method for Single-Agent Linear Time Synchronous Temporal Epistemic Logics with Interacting Time and Knowledge [chapter]

Mai Ajspur, Valentin Goranko
2013 Lecture Notes in Computer Science  
In this work we develop practically implementable tableau-based decision procedures for deciding satisfiability in single-agent synchronous temporal-epistemic logics with interactions between time and  ...  in EXPSPACE, respectively 2EXPTIME, for these logics, thereby also matching the upper bounds obtained for them by Halpern and Vardi.  ...  It was proved in [3] that any temporal-epistemic formula of the multi-agent linear time temporal epistemic logic with synchrony but without interaction of time and knowledge, is satisfiable in a TEM  ... 
doi:10.1007/978-3-642-36039-8_8 fatcat:wx23p3akyrguhkatzouplq7adq

Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions [article]

Alessio Lomuscio, Jakub Michaliszyn
2015 arXiv   pre-print
The Epistemic Halpern-Shoham logic (EHS) is a temporal-epistemic logic that combines the interval operators of the Halpern-Shoham logic with epistemic modalities.  ...  We prove that all the positive results known for EHS, notably the attractive complexity of its model checking problem for some of its fragments, still hold for its generalisation.  ...  HS is a modal temporal logic in which the elements of a model are pairs of points in time, or intervals.  ... 
arXiv:1509.00608v1 fatcat:cq2au6iuyzdnjl57njwh7jj7dm

Page 7281 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
This new technique was introduced for model checking of linear time temporal logic (LTL).  ...  Summary: “We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying seman- tics.  ... 

Combined model checking for temporal, probabilistic, and real-time logics

Savas Konur, Michael Fisher, Sven Schewe
2013 Theoretical Computer Science  
However, the development of new model checking tools for complex combinations of logics is both difficult and time consuming.  ...  In this article, we show how model checkers for the constituent temporal, probabilistic, and real-time logics can be re-used in a modular way when we consider combined logics involving different dimensions  ...  We would also like to thank Simon Dobson and Stephen Knox for providing the Scatterbox application and helpful discussions during the modelling of the system.  ... 
doi:10.1016/j.tcs.2013.07.012 fatcat:cjs5zxzwkrhoxh2qb7to7hevcy

Formal Approaches to Modelling and Verifying Resource-bounded Agents-state of the Art and Future Prospects

Abdur Rakib
2012 Journal of Information Technology & Software Engineering  
Citation: Rakib A (2012) Formal Approaches to Modelling and Verifying Resourcebounded Agents─state of the Art and Future Prospects. J Inform Tech Softw Eng 2:e109.  ...  The logical syntax contains both temporal and epistemic operators.  ...  The framework allows the use of abstract specifications consisting of Linear Time Temporal Logic (LTL) formulas to specify some of the agents in the system.  ... 
doi:10.4172/2165-7866.1000e109 fatcat:tgrwjtf5jvfphj3sl2sfvh3kpm

Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic [chapter]

Xiaowei Huang, Cheng Luo, Ron van der Meyden
2011 Lecture Notes in Computer Science  
The paper identifies a number of inefficiencies in prior encodings for bounded model checking for a logic of knowledge and branching time.  ...  Bounded model checking is a verification technique based on searching for counter-examples to the validity of the specification using an encoding to propositional sastisfiability.  ...  Bounded model checking was first proposed in the context of linear-time temporal logic, where the structure of the counter-examples can be taken to be a run, a linear sequence of states, with the final  ... 
doi:10.1007/978-3-642-20674-0_7 fatcat:nmzniymf5nhljdvzewojgka4dq

Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems [chapter]

Wei Wan, Jamal Bentahar, Abdessamad Ben Hamza
2011 Lecture Notes in Computer Science  
In order to check epistemic (i.e knowledge) and measurable properties in multi-agent systems, we propose a new logic P CT LK, which uses probabilistic, epistemic, and temporal modal operators.  ...  We extend the formalism of interpreted systems by adding probabilistic features to suit DTMC models and to present the model checking algorithm for our logic.  ...  ψ ::= φ | φ ∪ ≤n φ | φ ∪ φ where b ∈ [0, Three fragments, a temporal logic, an epistemic logic, and a probabilistic logic, are defined for P CT LK in addition to the standard Boolean connectives.  ... 
doi:10.1007/978-3-642-21827-9_8 fatcat:cxabmb7eb5bk7ekodqau4ilcie

Model Checking Systems Against Epistemic Specifications

Alessio R. Lomuscio
2014 Electronic Proceedings in Theoretical Computer Science  
To do so we introduce a further temporal-epistemic logic, called EHS RE , in which regular expressions are used within propositions, and give a polynomial time reduction of the model checking problem from  ...  We introduce EHS + , a novel temporal-epistemic logic defined on temporal intervals characterised by regular expressions.  ...  Model checking approaches against epistemic properties under linear time (Meyden and Shilov 1999; Gammie and van der Meyden 2004) and branching time (Penczek and Lomuscio 2003; Raimondi and Lomuscio  ... 
doi:10.4204/eptcs.146.0.3 fatcat:56n3cvwokfe4hjswl2al3ta2p4

Achieving completeness in the verification of action theories by Bounded Model Checking in ASP

L. Giordano, A. Martelli, D. T. Dupre
2013 Journal of Logic and Computation  
The paper deals with verification of action theories defined in a temporal extension of answer set programming which combines ASP with a dynamic linear time temporal logic (DLTL).  ...  The paper provides an encoding in ASP of the temporal action domains and of Bounded Model Checking of DLTL formulas.  ...  Acknowledgments: We thank the anonymous referees for their helpful comments. This work has been partially supported by Regione Piemonte, Project ICT4LAW.  ... 
doi:10.1093/logcom/ext067 fatcat:nhishu4n5zazvcgfpkss3nzgdu

Reasoning about Knowledge and Strategies under Hierarchical Information [article]

Bastien Maubert, Aniello Murano
2018 arXiv   pre-print
We solve the model-checking problem on a class of "hierarchical instances", which provides a solution to a vast class of strategic problems with epistemic temporal specifications on hierarchical systems  ...  The problem of distributed synthesis for epistemic temporal specifications is known to be undecidable for the latter semantics, already on systems with hierarchical information.  ...  The abovementioned works consider specifications from linear-time epistemic temporal logic LTLK, which extends LTL with knowledge operators.  ... 
arXiv:1806.00028v2 fatcat:ubxs6xnrmzdsfkodff6aio2xqy

Temporal Logics for Hyperproperties [chapter]

Michael R. Clarkson, Bernd Finkbeiner, Masoud Koleini, Kristopher K. Micinski, Markus N. Rabe, César Sánchez
2014 Lecture Notes in Computer Science  
A model checking algorithm for the proposed logics is given. For a fragment of HyperLTL, a prototype model checker has been implemented.  ...  Standard temporal logics such as LTL, CTL, and CTL * can refer only to a single path at a time, hence cannot express many hyperproperties of interest.  ...  [4] use a linear-time temporal epistemic logic to specify many declassification policies derived from noninterference.  ... 
doi:10.1007/978-3-642-54792-8_15 fatcat:wluatmohezcrfkppa6722d75ke

A Temporal Logic for Hyperproperties [article]

Bernd Finkbeiner, Markus N. Rabe, César Sánchez
2013 arXiv   pre-print
The model checking problem for temporal logic with path quantification is decidable.  ...  For alternation depth 1, the complexity is PSPACE in the length of the formula and NLOGSPACE in the size of the system, as for linear-time temporal logic.  ...  The linear time paradigm of logics like linear-time temporal logic (LTL) describes the correct behavior as a set of sequences [27] .  ... 
arXiv:1306.6657v1 fatcat:ktb4zyao6fdttpdrvawcucos5e
« Previous Showing results 1 — 15 out of 3,766 results