A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Filters
Symbolic model checking the knowledge of the dining cryptographers
Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004.
Preserved Fulltext
This paper describes how symbolic techniques (in particular, OBDD's) may be used to to implement an algorithm for model checking specifications in the logic of knowledge for a single agent operating with ...
As an illustration of the utility of this algorithm, the paper shows how it may be used to verify a security protocol: Chaum's Dining Cryptographers protocol, which provides a mechanism for anonymous broadcast ...
To illustrate the utility of model checking this class of specifications with respect to these assumptions, we consider a protocol drawn from the security literature: Chaum's Dining Cryptographers protocol ...
doi:10.1109/csfw.2004.1310747
fatcat:lhnvlzci7fdj5ohe3vwqow55b4
A Tool For Specification And Verification Of Epistemic Properties In Interpreted Systems
2004
Electronical Notes in Theoretical 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 2005; you can also visit the original URL.
The file type is application/pdf.
We apply this methodology to the verification of a communication protocol -the dining cryptographers. 1 ...
We show how an SMV model checker can be coupled with a Kripke model editor (Akka) to allow for the mechanical verification of epistemic properties of multi-agent systems. ...
• What particular symbolic representation -OBDD's, SAT-based, etc -is to be used for the model checking task? ...
doi:10.1016/s1571-0661(05)82609-x
fatcat:xdhxgq3ia5aolely43bmgy77ui
Symbolic model checking of probabilistic knowledge
2011
Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII
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.
This paper describes an algorithm for model checking a fragment of the logic of knowledge and probability in multi-agent systems, with respect to a perfect recall interpretation of knowledge and agents ...
Some experiments with the implemented algorithm are reported, in which some properties of agents' probabilistic knowledge are verified in two security protocols: Chaum's Dining Cryptographers protocol, ...
A SYMBOLIC MODEL CHECKING AL-GORITHM The question of model checking the logic of knowledge and time (without probabilities) with respect to perfect recall has been studied in a number of works [27, 19 ...
doi:10.1145/2000378.2000399
dblp:conf/tark/HuangLM11
fatcat:puz6sihvk5abhkcsfj2wolipcq
Optimizing Epistemic Model Checking using Conditional Independence
[article]
2016
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.
An optimization technique is developed that precedes the use of a model checking algorithm with an analysis that applies conditional independence reasoning to reduce the size of the model. ...
satisfies a formula expressed in a modal multi-agent logic of knowledge. ...
need to be handled by the symbolic model checking algorithms. ...
arXiv:1610.03935v1
fatcat:tdrjd6gd5ff6hmtfn7y2zzq6gm
Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
2007
Journal of Applied Logic
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.
The verification technique relies on model checking via ordered binary decision diagrams. ...
We present an implementation and report on experimental results for two scenarios: the bit transmission problem with faults and the protocol of the dining cryptographers. ...
The protocol of the dining cryptographers The protocol of the dining cryptographers was introduced in [19] , and model checking of its properties was discussed in [20] . ...
doi:10.1016/j.jal.2005.12.010
fatcat:lz5ssaqggraapainzft67uhbii
Optimizing Epistemic Model Checking Using Conditional Independence (Extended Abstract)
2017
Electronic Proceedings in Theoretical 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.
Other Versions
This paper shows that conditional independence reasoning can be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information ...
satisfies a formula expressed in a modal multi-agent logic of knowledge. ...
need to be handled by the symbolic model checking algorithms. ...
doi:10.4204/eptcs.251.29
fatcat:35uid64y4rhj5j4jqg4oowj64q
Abstraction for epistemic model checking of dining cryptographers-based protocols
2011
Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII
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 2011; you can also visit the original URL.
The file type is application/pdf.
This result can be used to optimize model checking of Dining Cryptographers-based protocols, and applied within a methodology for knowledge-based program implementation and verification. ...
Performance results are given for model checking knowledge-based specifications in the concrete and abstract models of this protocol, and some new conclusions about the protocol are derived. ...
Acknowledgments: Thanks to Xiaowei Huang and Kai Englehardt for comments on an earlier version of the paper. ...
doi:10.1145/2000378.2000408
dblp:conf/tark/Al-BatainehM11
fatcat:id2knqxvzjdddl77tzihia6ro4
Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
This result can be used to optimize model checking of Dining Cryptographers-based protocols, and applied within a methodology for knowledge-based program implementation and verification. ...
Performance results are given for model checking knowledge-based specifications in the concrete and abstract models of this protocol, and some new conclusions about the protocol are derived. ...
Acknowledgments: Thanks to Xiaowei Huang and Kai Englehardt for comments on an earlier version of the paper. ...
arXiv:1010.2287v1
fatcat:ojknvzfzfjdoxmhmseorkwpt6a
Verifying Computation Tree Logic of Knowledge via Knowledge-Oriented Petri Nets and Ordered Binary Decision Diagrams
2021
Computing and informatics
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 2022; you can also visit the original URL.
The file type is application/pdf.
We design the corresponding symbolic model checking algorithms and improve our tool. ...
We compare our model and method with MCMAS that is the state-of-the-art CTLK model checker, and experiments illustrate the advantages of our model and method. ...
Acknowledgement This paper is supported in part by the National Nature Science Foundation of China (Nos. 62032019 and 62172299), in part by the Shanghai Municipal Science and Technology Major Project ( ...
doi:10.31577/cai_2021_5_1174
fatcat:hyjonb7rufe5de6hcw6hllp2fy
Epistemic Model Checking for Knowledge-Based Program Implementation: an Application to Anonymous Broadcast
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The approach is illustrated using extensions of the Dining Cryptographers protocol, a security protocol for anonymous broadcast. ...
The paper describes how epistemic model checking technology may be applied to discover and verify concrete implementations based on this abstract level of description. ...
MCK is the only model checker currently available that supports symbolic model checking for the perfect recall interpretation of knowledge. ...
arXiv:1004.5130v1
fatcat:qk2ij7oca5ekdk3vjpv3qtkmbq
Epistemic Model Checking for Knowledge-Based Program Implementation: An Application to Anonymous Broadcast
[chapter]
2010
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
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 2011; you can also visit the original URL.
The file type is application/pdf.
The approach is illustrated using extensions of the Dining Cryptographers protocol, a security protocol for anonymous broadcast. ...
The paper describes how epistemic model checking technology may be applied to discover and verify concrete implementations based on this abstract level of description. ...
MCK is the only model checker currently available that supports symbolic model checking for the perfect recall interpretation of knowledge. ...
doi:10.1007/978-3-642-16161-2_25
fatcat:opdbllizpzbqdbiqrpiruz7cmi
Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
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 ...
SAT-based symbolic model checking SAT-based model checking is the most recent symbolic approach for modal logic. ...
OBDD-based symbolic model checking As it is customary in model checking in the following we analyse systems of finite states only. ...
arXiv:0709.0446v1
fatcat:uu2hztr4szhebmsqpj4bijluym
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. ...
The underlying semantical model considered throughout is the one of interpreted system, suitably extended whenever necessary. ...
SAT-based Symbolic Model Checking SAT-based model checking is the most recent symbolic approach for modal logic. ...
doi:10.1145/1324215.1324231
fatcat:eyfpocebrnauhi3pv5kzerxm4m
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
[chapter]
2009
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.
While these languages have been long explored and appropriate semantics developed, until recently there has been a remarkable gap in the availability of efficient symbolic model checking toolkits supporting ...
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 ...
,cryptographer n } ¬( n i=1 payer i )). We checked the second formula specifically to evaluate the performance of the tool against common knowledge. ...
doi:10.1007/978-3-642-02658-4_55
fatcat:stymco64o5ccpntc2gi2hcbmv4
Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
2017
Journal of Logic and Computation
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 do this by first providing a bridge: a new faithful representation of DEL models as so-called knowledge structures that allow for symbolic model checking. ...
For this purpose, we want to hook up with the best available model-checking and SAT techniques in computational logic. ...
Lemma 2 then allows us to show their correctness and get generalized versions of Theorems 2 and 3: For every belief structure there is an equivalent Kripke model and vice versa. ...
doi:10.1093/logcom/exx038
fatcat:xjsgicghczbmlbcaheijbe6g3u
« Previous
Showing results 1 — 15 out of 259 results