2013 | OriginalPaper | Buchkapitel
Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic
verfasst von : Artur Męski, Bożena Woźna-Szcześniak, Agnieszka M. Zbrzezny, Andrzej Zbrzezny
Erschienen in: Distributed Computing and Artificial Intelligence
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by (Link öffnet in neuem Fenster)
We tackle two symbolic approaches to bounded model checking (BMC) for an existential fragment of the soft real-time epistemic computation tree logic (RTECTLK) interpreted over interleaved interpreted systems. We describe a BDD-based BMC method for RTECTLK, and provide its experimental evaluation and comparison with a SAT-based BMC method. Moreover, we have attempted a comparison with MCMAS on several benchmarks.