Practical Abstractions for Model Checking Continuous-Time Multi-Agent Systems
Preprint
Abstract
Model checking of temporal logics in a well established technique to verify and validate properties of multi-agent systems (MAS). However, practical model checking requires input models of manageable size. In this paper, we extend the model reduction method by variable-based abstraction, proposed recently by Jamroga and Kim, to the verification of real-time systems and properties. To this end, we define a real-time extension of MAS graphs, extend the abstraction procedure, and prove its correctness for the universal fragment of Timed Computation Tree Logic (TCTL). Besides estimating the theoretical complexity gains, we present an experimental evaluation for a simplified model of the Estonian voting system and verification using the Uppaal model checker.Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Abstraction and Abstraction Refinement2018
- Handbook of Model Checking2018
- Timed Concurrent Game StructuresLecture Notes in Computer Science, 2007
- Yasm: A Software Model-Checker for Verification and RefutationLecture Notes in Computer Science, 2006
- Advances in Verification of Time Petri Nets and Timed Automata2006
- Monotonic Abstraction-Refinement for CTL2004
- Automatic Abstraction Using Generalized Model CheckingLecture Notes in Computer Science, 2002
- Counterexample-Guided Abstraction Refinement2000
- Model-Checking in Dense Real-TimeInformation and Computation, 1993
- All from one, one for all: on model checking using representatives1993