Skip to main content

Application of the Real-Time Concurrent Constraint Calculus

  • Chapter
  • First Online:
  • 977 Accesses

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 103))

Abstract

The rtcc calculus (Sarria and Rueda 2008; Sarria 2010) is a ccp-based formalism (Saraswat 1993), extension of the ntcc calculus (Palamidessi and Valencia 2001). rtcc is obtained from ntcc by adding constructs for specifying strong preemption and delay declarations, and by extending the transition system with support for resources, limited time and true concurrency. This calculus allows modeling real-time and reactive behaviour.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Allauzen C, Crochemore M, Raffinot M (1999) Factor oracle: a new structure for pattern matching. In: Conference on current trends in theory and practice of informatics. Springer-Verlag, London, pp 295–310

    Google Scholar 

  • Alpuente M, Gallardo MM, Pimentel E, Villanueva A (2006) Verifying real-time properties of tccp programs. J Univers Comput Sci 12(11):1551–1573

    Google Scholar 

  • Assayag G, Dubnov S (2004) Using factor oracles for machine improvisation. Soft Comput 8(9):604–610

    Google Scholar 

  • Brémond-Grégoire P, Lee I (1997) A process algebra of communicating shared resources with dense time and priorities. Theor Comput Sci 189(1–2):179–219

    Article  MATH  Google Scholar 

  • de Boer FS, Gabbrielli M, Meo MC (2000) A timed concurrent constraint language. Info Comput 161(1):45–83

    Article  MATH  Google Scholar 

  • de Boer FS, Pierro A Di, Palamidessi C (1995) Nondeterminism and infinite computations in constraint programming. In: Selected papers of the workshop on topology and completion in semantics. Theoretical Computer Science, vol 151. Chartres, Elsevier, pp 37–78

    Google Scholar 

  • Hoare CAR (1985) Communicating sequential processes. In: Prentice-Hall international series in computer science. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Milner R (1980) A calculus of communicating systems. In: Lecture notes in computer science. Springer-Verlag, Berlin/New York

    MATH  Google Scholar 

  • Palamidessi C, Valencia F (2001) A temporal concurrent constraint programming calculus. In: Seventh international conference on principles and practice of constraint programming. Lecture notes in computer science, vol 2239. Springer-Verlang, London, pp 302–316

    Google Scholar 

  • Perchy S, Sarria G (2009) Dissonances: brief description and its computational representation in the rtcc calculus. In: 6th sound and music computing conference (SMC2009), Porto, Portugal

    Google Scholar 

  • Rueda C, Assayag G, Dubnov S (2006) A concurrent constraints factor oracle model for music improvisation. In: XXXII conferencia Latinoamericana de informática CLEI 2006, Santiago de Chile

    Google Scholar 

  • Saraswat VA (1993) Concurrent constraint programming. In: ACM doctoral dissertation award. MIT, Cambridge, MA

    Google Scholar 

  • Sarria G (2010) Improving the real-time concurrent constraint calculus with a delay declaration. In: Lecture notes in engineering and computer science: proceedings of the world congress on engineering and computer science WCECS 2010. San Francisco, California. Newswood Ltd, Hong Kong, pp 9–14

    Google Scholar 

  • Sarria G, Rueda C (2008) Real-time concurrent constraint programming. In: 34th Latinamerican conference on informatics (CLEI2008), Santa Fe, Argentina

    Google Scholar 

  • Schneider S (2000) Concurrent and real-time systems: the CSP approach. Wiley, Chichester/New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Gerardo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gerardo, M., Sarria, M. (2011). Application of the Real-Time Concurrent Constraint Calculus. In: Ao, SI., Amouzegar, M., Rieger, B. (eds) Intelligent Automation and Systems Engineering. Lecture Notes in Electrical Engineering, vol 103. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0373-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-0373-9_29

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-0372-2

  • Online ISBN: 978-1-4614-0373-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics