publication . Part of book or chapter of book . Article . 1994

Symbolic Verification with Periodic Sets

Boigelot, Bernard; Wolper, Pierre;
Open Access
  • Published: 01 Jan 1994
  • Publisher: Springer Berlin Heidelberg
  • Country: Belgium
Abstract
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 and explicit representations can be fruitful. It introduces a representation of complex periodic sets of integer values, shows how this representation can be manipulated, and describes its application to the state-space exploration of protocols. Preliminary experimental res...
Subjects
arXiv: Computer Science::Databases
free text keywords: symbolic state-space exploration, infinite-state systems, verification, : Computer science [Engineering, computing & technology], : Sciences informatiques [Ingénierie, informatique & technologie]
Related Organizations
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue