A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
A Symbolic Model Checker for tccp Programs
[chapter]
2005
Lecture Notes in Computer Science
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model-checking algorithm for reactive systems. Our approach is based on using streams to extend Difference Decision Diagrams (DDDs) which generalize the classical Binary Decision Diagrams (BDDs) with constraints. We use streams to model the values of system variables along the time, as occurs in many other (declarative) languages. Then, we define a
doi:10.1007/11423331_5
fatcat:koere7d62zbchblctnsj76pixu