A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
We investigate partial order reduction for model checking multi-agent systems by focusing on interleaved interpreted systems. ...
We present a notion of stuttering-equivalence, and prove the semantical equivalence of stuttering-equivalent traces with respect to linear and branching time temporal logics for knowledge without the next ...
Partial order reductions As mentioned above, the idea of verification by model checking with partial order reduction is to define an algorithm that given a model can produce a smaller model provably validating ...
doi:10.1007/978-3-642-00431-5_7
fatcat:ho2ei5ki45ffjkjyzenz2nvjba
Symbolic model checking for temporal-epistemic logics
2007
ACM SIGACT News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
Several tools have been developed for model checking temporal logics, including: SPIN [28] for on-the-fly automata-based approach combined with partial-order reductions for LTL, SMV and NuSMV [47, 11 ...
doi:10.1145/1324215.1324231
fatcat:eyfpocebrnauhi3pv5kzerxm4m
To know or not to know: epistemic approaches to security protocol verification
2010
Synthese
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On the other hand, we discuss the cost of the epistemic operators in terms of model checking complexity. ...
Since BAN-logic, there have been several initiatives and attempts to incorporate epistemics into the analysis of security protocols. ...
Acknowledgements The authors would like to thank the anonymous referees for their insightful comments and Ramaswamy Ramanujam for the discussions on various issues that motivated this work. ...
doi:10.1007/s11229-010-9765-8
fatcat:ymd2ak35cbe2nejnh2eqp7dxtm
Computation as Conversation
[chapter]
2008
New Computational Paradigms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Against the backdrop of current research into 'logical dynamics' of information, we discuss twoway connections between conversation and computation, leading to a broader perspective on both. ...
Besides standard model checking and satisfiability,
there may be other natural complexity issues for dynamic-epistemic logics. ...
Model checking We start with model checking, i.e., determining whether M, s |= for a given model M and formula . ...
doi:10.1007/978-0-387-68546-5_3
fatcat:txxxurbl7baf7dlywdplm3o5lu
Open Problems in Logical Dynamics
[chapter]
2006
Mathematical Problems from Applied Logic I
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Eventually, this calls for a merge of epistemic and a temporal logic which allows for statements of regularities over time, often in the form of 'protocols' (Section 7). ...
But other significant questions concern mathematical modeling, finding perspicuous formal mechanisms for information update, or temporal evolution, or say, the logical behaviour of different types of agent ...
The axioms for D G φ also resemble standard modal ones.
. 5 Complexity Model checking of epistemic formulas in a given finite models takes polynomial time P, just as for modal formulas in general. ...
doi:10.1007/0-387-31072-x_3
fatcat:f5il7g4k6zcdndjrl3ymqaetl4
Dynamic logic for belief revision
2007
Journal of Applied Non-Classical Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. ...
Next, we show how various abstract postulates for belief revision can be analyzed by standard modal frame correspondences for model-changing operations. ...
and 'broccoli models' with Burgess-Veltman partial-order models. 14. ...
doi:10.3166/jancl.17.129-155
fatcat:7oxnabthubanpdledhbnzsooku
Towards Partial Order Reductions for Strategic Ability
2020
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
More importantly, we develop a methodology for partial order reduction in verification of agents with imperfect information. ...
We also demonstrate the effectiveness of the reduction on a number of benchmarks. Interestingly, the reduction does not work for strategic abilities under perfect information. ...
Acknowledgements We thank the anonymous reviewers for insightful comments. ...
doi:10.1613/jair.1.11936
fatcat:mkg3nsmh45fuhfabxid4jcqmba
Model Checking Distributed Systems against Temporal-Epistemic Specifications
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We study this domain by analysing ABS, an executable modelling language for object-based distributed systems and present a symbolic model checking methodology for verifying ABS programs against temporal-epistemic ...
Specifically, we show how to map an ABS program into an ISPL program for verification with MCMAS, a model checker for multi-agent systems. ...
The authors would like to thank the members of the HATS (FP7-231620) project, and in particular Rudolf Schlatte and Jan Schäfer, for providing access and help to the ABS compiler framework. ...
doi:10.1007/978-3-642-38592-6_10
fatcat:hway4lc4lbefvf2w2wcinqeejy
Model Checkers Are Cool: How to Model Check Voting Protocols in Uppaal
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we propose that the state-of-art model checker Uppaal provides a good environment for modelling and preliminary verification of voting protocols. ...
To illustrate this, we present an Uppaal model of Pr\^et \'a Voter, together with some natural extensions. ...
An additional, technical contribution consists in a reduction from model checking of temporal-epistemic specifications to purely temporal ones, in order to verify a variant of receipt-freeness despite ...
arXiv:2007.12412v2
fatcat:mbuirqffkfaidol42x32ko6zne
The information in intuitionistic logic
2008
Synthese
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We discuss connections between intuitionistic models and recent protocol models for dynamic-epistemic logic, as well as more general issues that emerge. ...
By now, the dominant version of this idea are intuitionistic Kripke models (Kripke 1963) , which we will take here as partial orders M = (W, ≤, V ) with a valuation V , setting: Here, in line with the ...
Acknowledgments I would like to thank Samson Abramsky, Georg Gottlob, Dan Isaacson, Sebastian Sequoiah-Grayson, and Tim Williamson for helpful comments. ...
doi:10.1007/s11229-008-9408-5
fatcat:c3k6w6pn7rfr7b67piq2paeyv4
Safraless Synthesis for Epistemic Temporal Specifications
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we address the synthesis problem for specifications given in linear temporal single-agent epistemic logic, KLTL (or KL1), over singleagent systems having imperfect information of the environment ...
The construction transforms first the synthesis problem into the problem of checking emptiness for universal co-Büchi tree automata using an information-set construction. ...
Epistemic Linear Time Temporal Logic (KLTL). We now define the logic KLTL for one-agent (the system). ...
doi:10.1007/978-3-319-08867-9_29
fatcat:crsvyl6kifacnnvpvbbtuunvda
Towards a Unifying Approach to Representing and Querying Temporal Data in Description Logics
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
, based on combinations of linear temporal logics with first-order queries. ...
Further, we advocate a controlled use of epistemic semantics in order to warrant practical query answering. ...
to temporal first-order logic. we advocate a controlled use of epistemic semantics in order to warrant practical query answering in the defined setting. ...
doi:10.1007/978-3-642-33203-6_8
fatcat:2np2ygklbfh73awl5gu2ycze44
Dynamic Epistemic Logic Games with Epistemic Temporal Goals
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this work we show that the decidability results obtained for reachability objectives extend to a much more general class of winning conditions, namely those expressible in the epistemic temporal logic ...
These games have been studied for reachability objectives, where the aim is to reach a situation satisfying some epistemic property expressed in epistemic logic; several (un)decidability results have been ...
We conjecture that our techniques could extend to even more expressive winning conditions, such as ones expressible in epistemic mu-calculus. ...
arXiv:2001.07141v1
fatcat:z2tmbnpcijfbletlrc5pdgldsa
From rules to runs: A dynamic epistemic take on imperfect information games
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose a modal logic to describe players' knowledge and its change during the plays, and provide a complete axiomatization. ...
In this paper, we try to separate and connect these two views by proposing a dynamic epistemic framework in which we can compute the runs step by step from the game rules plus the given assumptions of ...
logic without reduction axioms, via a class of normal run models. ...
arXiv:1512.02078v1
fatcat:mtclf4zcbndb3kjtftcpcxycwq
Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We identify a subproblem of the model-checking problem for the epistemic \mu-calculus which is decidable. ...
, with a suitable encoding, decidable instances of the model-checking problem for ATLiR. ...
Guelev for his careful reading of earlier versions of this paper. ...
arXiv:1310.6434v1
fatcat:oqd5mx4fxne5desdcwoveu27oe
« Previous
Showing results 1 — 15 out of 4,058 results