Skip to main content
SpringerLink
Log in

Proving Sequential Function Chart Programs Using Automata

  • Conference paper
  • First Online:
Automata Implementation (WIA 1998)

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

Included in the following conference series:

Abstract

Applications described by Sequential Function Chart (SFC) often being critical, we have studied the possibilities of program checking. In particular, physical time can be handled by SFC programs using temporisations, that’s why we are interested in the quantitative temporal properties. We have proposed a modeling of SFC in timed automata, a formalism which takes time into account. In this modeling, we use the physical constraints of the environment. Verification of properties can be carried out using the model-checker Kronos. We apply this method to SFC programs of average size like the one of the controlling part of the production cell Korso. The size of the programs remaining however a limit, we are studying the means of solving this problem.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1994.

    Article  Google Scholar 

  2. N. Bouteille, P. Brard, G. Colombari, N. Cotaina, and D. Richet. Le GRAFCET. “Cépadués Édition”, Toulouse, France, 1992.

    Google Scholar 

  3. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool Kronos. In R. Alur, T. Henzinger, and E.D. Sontag, editors, DIMACS Workshop on Verification and Control of Hybrid Systems, pages 208–219. LNCS 1066, Springer-Verlag, 1995.

    Google Scholar 

  4. C. Ghezzi, D. Mandrioli, S. Morasca, and M Pezzé. A unified high-level Petri net formalism for time-critical systems. IEEE Transactions On Software Engineering, 17(2):160–172, February 1991.

    Article  Google Scholar 

  5. N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, 5th Conference on Computer-Aided Verification, pages 333–346. LNCS 697, Springer-Verlag, 1993.

    Google Scholar 

  6. N. Halbwachs, F. Lagnier, and C. Ratel. Programming and verifying real-time system by means of the synchronous data-flow language Lustre. IEEE Transactions on Software Engineering, 18(9):785–793, September 1992.

    Article  Google Scholar 

  7. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for real-time systems. Information and Computation, 111(2):193–244, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Le Guernic, T. Gautier, M. Le Borgne, and C. Le Maire. Programming real time applications with Signal. Proceedings of the IEEE, 79(9):1321–1336, 1991.

    Article  Google Scholar 

  9. P. Le Parc, D. L’Her, J.L. Scharbarg, and L. Marcé. Le Grafcet revisité á l’aide d’un langage synchrone flot de données. Technique et Science Informatiques, 17(1):63–86, January 1998.

    Google Scholar 

  10. C. Lewerentz and T. Lindner. Case study ‘production cell’: A comparative study in formal specification and verification. In C. Lewerentz and T. Lindner, editors, Formal Development of Reactive Systems: Case Study Production Cell, pages 1–54. LNCS 891, Springer-Verlag, 1995.

    Google Scholar 

  11. D. L’Her. Modélisation du Grafcet temporisé et vérification de propriétés temporelles. PhD thesis, Université de Rennes 1 (France), September 1997.

    Google Scholar 

  12. X. Nicollin, J. Sifakis, and S. Yovine. Co mpiling real-time specifications into extended automata. IEEE Transaction on Software Engineering. Special Issue on Real-Time Systems, 18(9):794–804, 1992.

    Google Scholar 

  13. J.S. Ostroff. Automated Verification of Timed Transition Models. In G. Goos and J. Hartmanis, editors, Workshop on Automatic Verification Methods for Finite State Systems, pages 247–256. LNCS 407, Springer-Verlag, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIMI Université de Bretagne Occidentale, 6 av. V. Le Gorgeu, BP 809, 29285, Brest cedex, France

    Dominique L’Her, Philippe Le Parc & Lionel Marcé

Authors
  1. Dominique L’Her
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Le Parc
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lionel Marcé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Laboratory, University of Rouen, F-76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud  & Djelloul Ziadi  & 

  2. LI/E3i University of Tours, 64 avenue Jean Portalis, F-37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

L’Her, D., Le Parc, P., Marcé, L. (1999). Proving Sequential Function Chart Programs Using Automata. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-48057-9_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66652-3

  • Online ISBN: 978-3-540-48057-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation