Symmetry reduction for CTL ∗ based model checking
System Reduction Based on Symmetry in Game Model Checking
... system model of Alternating-time Temporal Logic (ATL) model checking based on symmetry and gives two experiments on tic-tac-toe and go in small ...
6
Bounded saturation-based CTL model checking
... the model checking ...the model and it influences the number of tokens in ...a model of the communication protocol [18], where N is the number of participants in the ...SR-100 model is ...
12
Symmetry Reduction for STE Model Checking Using Structured Models
... STE model checking Symbolic trajectory evaluation [96] – STE in short, is a model checking technique that combines the ideas of ternary modelling with symbolic ...circuit model of the ...
198
Symmetry Reduced Model Checking for B
... Abstract Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model ...for symmetry reduced model checking of B machines, which ...
10
Model Checking CTL is Almost Always Inherently Sequential
... of CTL- operators, the model checking problem CTL mon -MC(T ) is ...single CTL-operator O, we will show that CTL mon -MC(T ) is LOGCFL-hard for all T ⊇ {O} by giving a generic ≤ ...
9
Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse
... tree-like [9]. In [6, 15, 22], a counterexample or witness in a bounded model is represented as a set of bounded paths. Different encoding schemes based on proof system were proposed in [14, 19], in the ...
17
MoL 2003 07: XML Query Evaluation via CTL Model Checking
... the model representation for ...symbolic model checker. The symbolic representation of a model is usually much smaller than its explicit representation, and in some cases its size is logarithmic in ...
45
Rewriting-based model checking methods
... mathematical model of a collection of interconnected state machines running at different rates, yet synchronously in terms of their ...Second, based on these modular transformations, this chapter presents a ...
372
State/Event-based Software Model Checking
... as CTL ∗ or the modal mu-calculus) is the ability to invoke the MAGIC compositional abstrac- tion refinement procedures developed for the efficient verification of concurrent software ...
20
Symmetry Reduction for B by Permutation Flooding
... Abstract. Symmetry reduction is an established method for limiting the amount of states that have to be checked during exhaustive model ...classical symmetry reduction in ...
15
Symmetry reduction for stochastic hybrid systems
... probabilistic model checking techniques from computer science can be extending for ...for symmetry reduction of the state space for continuous probabilistic ...are based on the same ...
6
LTL Model Checking with Logic Based Petri Nets
... Systems M are usually represented as Kripke structures. When dealing with con- current systems formulæ are often expressed in Computational Tree Logic (CTL) or Linear Time Logic (LTL) [4]. Established model ...
14
Model Checking Trust-based Multi-Agent Systems
... trust based on the sole agents’ mental ...abstraction based on the social behaviors of ...the CTL logic [43] with a new operator for trust along with its intuitive semantics to effectively modeling ...
142
A CTL-Based Logic for Program Abstractions
... negative model checking result on the abstract system there- fore need not reflect an error in the concrete system but it ...negative model checking results too often, one would like to “get ...
15
Symmetry reduction for SAT representations of transition systems
... Most symmetry reduction algorithms are embedded in state space traversal algorithms: the successor states (or, for backward traversal, the predecessor states or sets of prede- cessor states) of a state are ...
9
Using Assumptions to Distribute CTL Model Checking
... distribute model checking. Closest to our work is the modular model checking approach by Yorav and ...a model checking algorithm for pushdown processes and consider the semantics ...
16
Model Checking CTL is Amost Always Inherently Sequential
... Obviously, K, w | = ϕ iff K ′ , w | = ϕ ′ for all w ∈ W . The mapping (K, w, ϕ) 7→ (K ′ , w, ϕ ′ ) can be performed by an AC 0 -circuit. In Section 3.3, we complete the picture by proving CTL pos -MC(T ) ≤ cd ...
22
Model Checking Based Approach for Compliance Checking
... a model for which compliance checking can be performed to find commonalities and discrepancies between the modeled behavior and the observed behavior ...the model and as temporal logic formulae; in ...
21
Model Based Trace Checking
... by checking them against a formal model using a standard model-checker or else an animator for executable ...popular model-checker, and Pro-B, a model-checker and animator for the B ...
15
Dynamic Partial-Order Reduction for Model Checking Software
... making model checking intractable for all but a small number of ...partial-order reduction that avoids the inherent imprecisions of static alias ...
12