Skip to content

Bounded model checking for the existential part of real-time CTL and knowledge

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

A considerably large class of multi-agent systems operate in distributed and real-time environments, and often their correctness specifications require us to express time-critical properties that depend on performed actions of the system. In the paper, we focus on the formal verification of such systems by means of the bounded model checking (BMC) method, where specifications are expressed in the existential fragment of the Real-Time Computation Tree Logic augmented to include standard epistemic operators. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Woźna-Szcześniak, B. (2012). Bounded model checking for the existential part of real-time CTL and knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7054 LNCS, pp. 164–178). https://doi.org/10.1007/978-3-642-28038-2_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free