Abstract
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 symbolic (finite states) model checking algorithm for tccp which mitigates the state explosion problem that is common to more conventional model checking approaches. We show how the symbolic approach to model checking for tccp improves previous approaches based on the classical Linear Time Logic (LTL) model checking algorithm.
This work has been partially supported by MCYT under grants TIC2001-2705-C03-01, HU2003-0003, by Generalitat Valenciana under grants GR03/025, GV04/389 and by ICT for EU-India Cross Cultural Dissemination Project under grant ALA/95/23/2003/077-054.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alpuente, M., Falaschi, M., Villanueva, A.: Symbolic Representation Timed Concurrent Constraint Programs. Technical Report DSIC-II/12/04, DSIC, Technical University of Valencia (2004), Available at www.dsic.upv.es/users/elp/villanue/papers/techrep04.ps
Alpuente, M., Gallardo, M.M., Pimentel, E., Villanueva, A.: Abstract Model Checking of tccp programs. In: Proc. of the 2nd Workshop on Quantitative Aspects of Programming Languages (QAPL 2004). Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, Amsterdam (2004)
de Boer, F.S., Gabbrielli, M., Meo, M.C.: A Timed Concurrent Constraint Language. Information and Computation 161, 45–83 (2000)
de Boer, F.S., Gabbrielli, M., Meo, M.C.: A Temporal Logic for reasoning about Timed Concurrent Constraint Programs. In: Smolka, G. (ed.) Proc. of 8th International Symposium on Temporal Representation and Reasoning, pp. 227–233. IEEE Computer Society Press, Los Alamitos (2001)
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)
Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)
Clarke, E.M., McMillan, K.M., Campos, S., Hartonas-GarmHausen, V.: Symbolic Model Checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 419–422. Springer, Heidelberg (1996)
Falaschi, M., Policriti, A., Villanueva, A.: Modeling Timed Concurrent systems in a Temporal Concurrent Constraint language - I. In: Dovier, A., Meo, M.C., Omicini, A. (eds.) Selected papers from 2000 Joint Conference on Declarative Programming. Electronic Notes in Theoretical Computer Science, vol. 48. Elsevier Science Publishers, Amsterdam (2000)
Falaschi, M., Villanueva, A.: Automatic verification of timed concurrent constraint programs. Theory and Practice of Logic Programming (2004) (to appear)
Møller, J., Lichtenberg, J., Andersen, H.R., Hulgaard, H.: Difference Decision Diagrams. In: Flum, J., RodrÃguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 111–125. Springer, Heidelberg (1999)
Saraswat, V.A., Rinard, M., Panangaden, P.: Semantic Foundations of Concurrent Constraint Programming. In: Proc. of 18th Annual ACM Symposium on Principles of Programming Languages, pp. 333–352. ACM Press, New York (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alpuente, M., Falaschi, M., Villanueva, A. (2005). A Symbolic Model Checker for tccp Programs. In: Guelfi, N. (eds) Rapid Integration of Software Engineering Techniques. RISE 2004. Lecture Notes in Computer Science, vol 3475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423331_5
Download citation
DOI: https://doi.org/10.1007/11423331_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25812-4
Online ISBN: 978-3-540-32039-5
eBook Packages: Computer ScienceComputer Science (R0)