A comprehensive survey on the current research efforts to verify the cache coherence protocols is presented. Methods with mechanical verification procedures such as the state enumeration (symbolic), model checking, and symbolic state model are specifically discussed. The underlying approach of each method to handle the state space explosion problem for verification is focused. The efficiency an...

ion In Model Checking Real-Time Temporal Logic of Knowledge CongHua Zhou Jiangsu University, Zhenjiang, 212013, China Email: [email protected] Bo Sun Jiangsu University, Zhenjiang, 212013, China Email: [email protected] Abstract—Model checking in real-time temporal logic of knowledge TACTLK confronts the same challenge as in traditional model checking, that is the state space explosion problem. I...

An Asynchronous Büchi Automaton is a collection of concurrently executing automata, able to perform operations that are shared between one or more of their concurrent components. These automata can be used to specify properties of distributed protocols. In this paper, an efficient method for verifying that a protocol satisfies its Asynchronous Büchi Automaton specification is presented. In orde...

State space generation is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. The sleep set method is one way to try to avoid generating all of the state space when verifying a given property. This paper is concentrated on th...

Model checking is a formal verification technique used to prove that a system satisfies its specification. The system is described by a state transition system (called Kripke structure) and the specification of the system is defined via properties written in temporal logic. The model checking problem consists of exploring every possible state of the Kripke structure and checking if the properti...

We present an improved approach to verifying systems involving many copies of a few kinds of components. Replication of this type occurs frequently in practice and is regarded a major source of state explosion during temporal logic model checking. Our solution makes use of symmetry reduction through counter abstraction. The efficiency of this approach directly depends on the size of the compone...

Quantitative conformance testing of cyber-physical system (CPS) exploits time series of measurements, such as temperature or energy, for validating the correctness of deployed systems. This paper presents the foundations of segmented state space traversal in the setting of quantitative conformance testing of a CPS. It is demonstrated how this strategy together with domain-specific adaptations r...

A technique for logic decomposition of asynchronous circuits which works on STG unfolding prefixes rather than state graphs is proposed. It retains all the advantages of the state space based approach, such as the possibility of multiway acknowledgement, latch utilisation and highly optimised circuits. Moreover, it significantly alleviates the state space explosion, and thus has superior memory...

Symbolic approaches attack the state explosion problem by introducing implicit representations that allow the simultaneous manipulation of large sets of states. The most commonly used representation in this context is the Binary Decision Diagram (BDD). This paper takes the point of view that other structures than BDD's can be useful for representing sets of values, and that combining implicit a...

Symbolic approaches attack the state explosion problem by introducing implicit representations that allow the simultaneous manipulation of large sets of states. The most commonly used representation in this context is the Binary Decision Diagram (BDD). This paper takes the point of view that other structures than BDD’s can be useful for representing sets of values, and that combining implicit a...