Skip to main content
Springer Nature Link
Log in

Linear Temporal Logic of Constraint Automata

  • Conference paper
Advances in Computer Science and Engineering (CSICC 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 6))

Included in the following conference series:

Abstract

Constraint automata are formalisms to describe the behavior and possible data flow in coordination models. In this paper we introduce a linear time temporal logic, called temporal logic of steps (TLS), for specifying the executions of constraint automata. TLS is the first attempt in presenting a linear temporal logic for constraint automata. Having TLS in hand, we are able to design model checking algorithms for verification of concurrent systems modeled by constraint automata.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2002. LNCS, vol. 2755, pp. 34–55. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling Component Connectors in Reo by Constraint Automata. Science of Computer Programming 61, 75–113 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Clarke, E.M., Burch, J.R., Grumberg, O., Pled, D.A.: Model Checking. MIT Press, Cambridge

    Google Scholar 

  4. Lamport, L.: The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems 16(3), 872–923 (1994)

    Article  Google Scholar 

  5. Muler, O.: A Verification Environment for I/O Automata -Part I: Temporal Logic and Abstraction-. TUM-INFO-06-I9911-50/1.FI (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Science, Sharif University of Technology, Tehran, Iran

    Sara Navidpour

  2. Research Institute for Humanities (IHCS) and Department of Computer Engineering, Sharif University of Technology, Tehran, Iran

    Mohammad Izadi

Authors
  1. Sara Navidpour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Izadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IPM School of Computer Science, and Department of Computer Engineering, Sharif Unversity of Technology, Azadi Street, Tehran, Iran

    Hamid Sarbazi-Azad

  2. Department of Electrical and computer Engineering, UC Irvine, California, USA

    Behrooz Parhami

  3. Department of Computer Engineering, Sharif University of Technology,, Azadi Street, Tehran, Iran

    Seyed-Ghassem Miremadi

  4. Department of Computer Engineering, Sharif University of Technology, Azadi Street, Tehran, Iran

    Shaahin Hessabi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Navidpour, S., Izadi, M. (2008). Linear Temporal Logic of Constraint Automata. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_146

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89985-3_146

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89984-6

  • Online ISBN: 978-3-540-89985-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics