Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 2003: Logic Programming pp 422–437Cite as

Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2916))

Abstract

The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifications. A typical behavioral observation in ccp is the strongest postcondition (sp). The ntcc sp denotes the set of all infinite output sequences that a given process can exhibit. The verification problem is then whether the sequences in the sp of a given process satisfy a given ntcc LTL formula.

This paper presents new positive decidability results for timed ccp as well as for LTL. In particular, we shall prove that the following problems are decidable: (1) The sp equivalence for the so-called locally-independentntcc fragment; unlike other fragments for which similar results have been published, this fragment can specify infinite-state systems. (2) Verification for locally-independent processes and negation-free first-order formulae of the ntcc LTL. (3) Implication for such formulae. (4) Satisfiability for a first-order fragment of Manna and Pnueli’s LTL. The purpose of the last result is to illustrate the applicability of ccp to well-established formalisms for concurrency.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M.: The power of temporal proofs. Theoretical Computer Science 65, 35–84 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Buchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Conf. on Logic, Methodology, and Philosophy of Science, pp. 1–11 (1962)

    Google Scholar 

  3. Choueka, Y.: Theories of automata on ω-tapes:A simplified approach. Computer and System Sciences 10, 19–35 (1974)

    MathSciNet  MATH  Google Scholar 

  4. de Boer, F., Gabbrielli, M., Meo, M.C.: Atimed concurrent constraint language. Information and Computation 161, 45–83 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. de Boer, F., Gabbrielli, M., Marchiori, E., Palamidessi, C.: Proving concurrent constraint programs correct. ACM Transactions on Programming Languages and Systems 19(5) (1997)

    Google Scholar 

  6. Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, p. 223. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Esparza, J., Melzer, S.: Model checking LTL using constraint programming. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248. Springer, Heidelberg (1997)

    Google Scholar 

  8. Falaschi, M., Policriti, A., Villanueva, A.: Modelling timed concurrent systems in a temporal concurrent constraint language - I. ENTCS, vol. 48 (2001)

    Google Scholar 

  9. Hodkinson, I., Wolter, F., Zakharyasche, M.: Decidable fragments of first-order temporal logic. Ann. Pure. Appl. Logic 106, 85–134 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  11. Merz, S.: Decidability and incompleteness results for first-order temporal logics of linear time. Journal of Applied Non-Classical Logic 2(2) (1992)

    Google Scholar 

  12. Milner, R.: A finite delay operator in synchronous ccs. TR CSR-116-82, Univ. of Edinburgh

    Google Scholar 

  13. Milner, R.: Communicating and Mobile Systems: the π-calculus (1999)

    Google Scholar 

  14. Nielsen, M., Palamidessi, C., Valencia, F.: On the expressive power of concurrent constraint programming languages. In: PPDP 2002, October 2002, pp. 156–167. ACM Press, New York (2002)

    Chapter  Google Scholar 

  15. Nielsen, M., Palamidessi, C., Valencia, F.: Temporal concurrent constraint programming: Denotation, logic and applications. Nordic Journal of Computing 9(2), 145–188 (2002)

    MATH  MathSciNet  Google Scholar 

  16. Nielsen, M., Valencia, F.: Temporal Concurrent Constraint Programming: Applications and Behavior. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 298–324. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Palamidessi, C., Valencia, F.: A temporal concurrent constraint programming calculus. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, p. 302. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Saraswat, V., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: Proc. of LICS 1994, pp. 71–80 (1994)

    Google Scholar 

  19. Saraswat, V., Jagadeesan, R., Gupta, V.: Programming in timed concurrent constraint languages. In: Constraint Programming: Proc. 1993, pp. 361–410. Springer, Heidelberg (1994)

    Google Scholar 

  20. Saraswat, V., Jagadeesan, R., Gupta, V.: Timed default concurrent constraint programming. Journal of Symbolic Computation 22, 475–520 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  21. Saraswat, V., Rinard, M., Panangaden, P.: The semantic foundations of concurrent constraint programming. In: POPL 1991, pp. 333–352 (1991)

    Google Scholar 

  22. Sistla, A., Vardi, M., Wolper, P.: The complementation problem for buchi automata with applications to temporal logic. Theoretical Computer Science 49, 217–237 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  23. Tini, S.: On the expressiveness of timed concurrent constraint programming. ENTCS, vol. 27 (1999)

    Google Scholar 

  24. Valencia, F.: Temporal Concurrent Constraint Programming. PhD thesis, BRICS Univ. of Aarhus (2003), Available online via http://www.brics.dk/~fvalenci/publications.html

  25. Vardi, M.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Technology, Uppsala University, Box 337, SE-751 05, Uppsala, Sweden

    Frank D. Valencia

Authors
  1. Frank D. Valencia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valencia, F.D. (2003). Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24599-5_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20642-2

  • Online ISBN: 978-3-540-24599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation