A Data Symmetry Reduction Technique for Temporal-epistemic Logic

Cohen, Mika; Dam, Mads; Lomuscio, Alessio; Qu, Hongyang

doi:10.1007/978-3-642-04761-9_6

Cited by 19 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While abstraction methodologies for various artifact-inspired systems and multi-agent systems have been put forward [14,4,10,6,7], they all lack support for program verification and operate on logical models, thereby making automatic model checking impracticable. Our objective in this paper was to overcome this limitation and provide GSM with an agent-based semantics, so that information-theoretic properties such as knowledge of the participants could be verified.…”

Section: Discussionmentioning

confidence: 99%

Verification of GSM-Based Artifact-Centric Systems through Finite Abstraction

Belardinelli

Lomuscio

Patrizi

2012

Service-Oriented Computing

Self Cite

View full text Add to dashboard Cite

Abstract. The GSM framework provides a methodology for the development of artifact-centric systems, an increasingly popular paradigm in service-oriented computing. In this paper we tackle the problem of verifying GSM programs in a multi-agent system setting. We provide an embedding from GSM into a suitable multi-agent systems semantics for reasoning about knowledge and time at the first-order level. While we observe that GSM programs generate infinite models, we isolate a large class of "amenable" systems, which we show admit finite abstractions and are therefore verifiable through model checking. We illustrate the contribution with a procurement use-case taken from the relevant business process literature.

show abstract

Section: Discussionmentioning

confidence: 99%

Verification of GSM-Based Artifact-Centric Systems through Finite Abstraction

Belardinelli

Lomuscio

Patrizi

2012

Service-Oriented Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Engelhardt et al (2002)). Moreover, some model checking techniques such as abstraction and symmetry reduction that are specific to ETL or DEL can be found in (Dechesne et al, 2008;Cohen et al, 2009a;Cohen et al, 2009b). Due to the space limitations we will not go into the details.…”

Section: Relevant Results Of Model Checking Etlmentioning

confidence: 99%

To know or not to know: epistemic approaches to security protocol verification

Dechesne

Wang

2010

Synthese

View full text Add to dashboard Cite

Abstract. Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents. Since BAN-logic, there have been several initiatives and attempts to incorporate epistemics into the analysis of security protocols. In this paper, we give an overview of work in the field and present it in a unified perspective, with comparisons on technical subtleties that have been employed in different approaches.Also, we study to which degree the use of epistemics is essential for the analysis of security protocols. We look for formal conditions under which knowledge modalities can bring extra expressive power to pure temporal languages. On the other hand, we discuss the cost of the epistemic operators in terms of model checking complexity.

show abstract

“…We are also aware of the similar attempts formulated in (Cohen et al, 2009). Recently abstraction-refinement techniques have been applied to dynamic epistemic logic (Wang, 2010).…”

Section: Muddy Children Solvabilitymentioning

confidence: 99%

A note on a generalization of the Muddy Children puzzle

Gierasimczuk¹,

Szymanik²

2011

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge

View full text Add to dashboard Cite

We study a generalization of the Muddy Children puzzle by allowing public announcements with arbitrary generalized quantifiers. We propose a new concise logical modeling of the puzzle based on the number triangle representation of quantifiers. Our general aim is to discuss the possibility of epistemic modeling that is cut for specific informational dynamics. Moreover, we show that the puzzle is solvable for any number of agents if and only if the quantifier in the announcement is positively active (satisfies a form of variety).

show abstract

A Data Symmetry Reduction Technique for Temporal-epistemic Logic

Cited by 19 publications

References 13 publications

Verification of GSM-Based Artifact-Centric Systems through Finite Abstraction

Verification of GSM-Based Artifact-Centric Systems through Finite Abstraction

To know or not to know: epistemic approaches to security protocol verification

A note on a generalization of the Muddy Children puzzle

Contact Info

Product

Resources

About