Skip to main content

Step by Step to Histories

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 2000)

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

Abstract

The behavior of reactive systems is typically specified by state machines. This results in an operational description of how a system produces its output. An alternative and more abstract approach is to just specify the relation between the input and output histories of a system. In this work, we propose a way to combine state-based and history-based specifications: Abstract communication history properties of system components can be derived from temporal logic properties of state machines. The history properties can then be used to deduce global properties of a complete system.

This work is supported by the DFG within the Sonderforschungsbereich 342.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. N. Bjørner, A. Browne, E. Chang, M. Colón, A. Kapur, Z. Manna, H. B. Sipma, and T. E. Uribe. STeP: Deductive-Algorithmic Verification of Reactive and Real-time Systems. In CAV’96. Lecture Notes in Computer Science 1102, pages 415–418, 1996.

    Google Scholar 

  2. M. Breitling and J. Philipps. Black Box Views of State Machines. Technical Report TUM-I9916, Institut für Informatik, Technische Universität München, 1999.

    Google Scholar 

  3. J. D. Brock and W. B. Ackermann. Scenarios: A model of nondeterministic computation. In J. Diaz and I. Ramos, editors, Lecture Notes in Computer Science 107, pages 225–259, 1981.

    Google Scholar 

  4. I. A. Browne, Z. Manna, and H. B. Sipma. Generalized temporal verification diagrams. In Lecture Notes in Computer Science 1026, pages 484–498, 1995.

    Google Scholar 

  5. M. Broy. Functional specification of time sensitive communicating systems. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Models, Formalism, Correctness. Lecture Notes in Computer Science 430, pages 153–179. Springer, 1990.

    Google Scholar 

  6. M. Broy. From states to histories. In Engineering Theories of Software Construction. NATO Science Series F, Marktoberdorf Summer School, 2000. To be published.

    Google Scholar 

  7. M. Broy, F. Dederichs, C. Dendorfer, M. Fuchs, T. F. Gritzner, and R. Weber. The Design of Distributed Systems: An Introduction to Focus—Revised Version. Technical Report TUM-I9202-2, Institut für Informatik, Technische Universität München, 1993.

    Google Scholar 

  8. M. Broy, F. Huber, B. Paech, B. Rumpe, and K. Spies. Software and system modeling based on a unified formal semantics. In M. Broy and B. Rumpe, editors, Requirements Targeting Software and Systems Engineering, International Workshop RTSE’97. Lecture Notes in Computer Science 1526. Springer, 1998.

    Google Scholar 

  9. F. Huber, B. Schätz, A. Schmidt, and K. Spies. Autofocus—a tool for distributed systems specification. In Proceedings FTRTFT’96 — Formal Techniques in Real-Time and Fault-Tolerant Systems. Lecture Notes in Computer Science 1135, 1996.

    Google Scholar 

  10. L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages, 6(3):872–923, May 1994.

    Article  Google Scholar 

  11. Z. Manna and A. Pnueli. Models for reactivity. Acta Informatica, 30:609–678, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. L. C. Paulson. Logic and Computation. Cambridge University Press, 1987.

    Google Scholar 

  13. L. C. Paulson. Isabelle: A Generic Theorem Prover. Lecture Notes in Computer Science 828. Springer, 1994.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Breitling, M., Philipps, J. (2000). Step by Step to Histories. In: Rus, T. (eds) Algebraic Methodology and Software Technology. AMAST 2000. Lecture Notes in Computer Science, vol 1816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45499-3_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45499-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45499-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics