Abstract
The Concurrent Constraint Paradigm (cc in short) is a simple and highly expressive formalism for modeling concurrent systems where agents execute asynchronously, interacting among them by adding and consulting constraints in a global store. The cc model replaces the notion of store-as-valuation with the notion of store-as-constraint. There exist several programming languages that extend the cc model by introducing a notion of time. The notion of time allows us to represent concurrent and reactive systems. The different definitions for time make each language better suited for modeling a specific kind of application (deterministic embedded systems, non-deterministic reactive systems, etc.). This paper studies the relation between the universal timed concurrent constraint language (utcc in short) and the timed concurrent constraint language (tccp). We show how utcc can be mapped into tccp by means of a transformation that preserves the original behavior. We also prove the correctness of the transformation.
This work has been supported by the Spanish MEC/MICINN under grants TIN2007-68093-C02-02 and TIN2010-21062-C02-02, and by the Generalitat Valenciana under grant Emergentes GV/2009/024.
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., Gallardo, M.M., Pimentel, E., Villanueva, A.: Verifying Real-Time Properties of tccp Programs. Journal of Universal Computer Science 12(11), 1551–1573 (2006)
Alpuente, M., Gallardo, M., Pimentel, E., Villanueva, A.: A semantic framework for the abstract model checking of tccp programs. Theoretical Computer Science 346(1), 58–95 (2005)
Boer, F.S.d., Gabbrielli, M., Meo, M.C.: A Timed Concurrent Constraint Language. Information and Computation 161(1), 45–83 (2000)
Caspi, P., Pilaud, D., Halbwachs, N., Plaice, J.A.: LUSTRE: a declarative language for real-time programming. In: POPL 1987: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 178–188. ACM, New York (1987)
Gupta, V., Saraswat, V.A., Jagadeesan, R.: Foundations of Timed Concurrent Constraint Programming. In: Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, pp. 71–80. IEEE Computer Society Press, Los Alamitos (July 1994)
Harel, D., Pnueli, A.: On the development of reactive systems, pp. 477–498 (1985)
Lescaylle, A., Villanueva, A.: Using tccp for the Specification and Verification of Communication Protocols. In: Proceedings of the 16th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2007) (2007)
Lescaylle, A., Villanueva, A.: Verification and Simulation of protocols in the declarative paradigm. Technical report, DSIC, Univeridad Politécnica de Valencia (2008), http://www.dsic.upv.es/~alescaylle/files/dea-08.pdf
Lescaylle, A., Villanueva, A.: The tccp Interpreter. Electron. Notes Theor. Comput. Sci. 258(1), 63–77 (2009)
Maraninchi, F.: Operational and compositional semantics of synchronous automaton compositions. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 550–564. Springer, Heidelberg (1992)
Nielsen, M., Palamidessi, C., Valencia, F.D.: Temporal Concurrent Constraint Programming: Denotation, Logic and Applications. Nordic Journal of Computing 9(1), 145–188 (2002)
Nielsen, M., Palamidessi, C., Valencia, F.D.: On the expressive power of temporal concurrent constraint programming languages. In: PPDP 2002: Proceedings of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 156–167. ACM, New York (2002)
Olarte, C., Valencia, F.D.: The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security. In: PPDP 2008: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, pp. 8–19. ACM, New York (2008)
Olarte, C., Valencia, F.D.: Universal concurrent constraint programing: symbolic semantics and applications to security. In: SAC 2008: Proceedings of the 2008 ACM Symposium on Applied Computing, pp. 145–150. ACM, New York (2008)
Saraswat, V.A.: Concurrent Constraint Programming Languages. The MIT Press, Cambridge (1993)
Tini, S.: On the Expressiveness of Timed Concurrent Constraint Programming. In: Electronics Notes in Theoretical Computer Science, Electronics (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lescaylle, A., Villanueva, A. (2011). Bridging the Gap between Two Concurrent Constraint Languages. In: Mariño, J. (eds) Functional and Constraint Logic Programming. WFLP 2010. Lecture Notes in Computer Science, vol 6559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20775-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-20775-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20774-7
Online ISBN: 978-3-642-20775-4
eBook Packages: Computer ScienceComputer Science (R0)