Skip to main content
SpringerLink
Log in

Smart Play-out of Behavioral Requirements

  • Conference paper
  • First Online:
Formal Methods in Computer-Aided Design (FMCAD 2002)

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

Included in the following conference series:

Abstract

We describe a methodology for executing scenario-based requirements of reactive systems, focusing on “playing-out” the behavior using formal verification techniques for driving the execution. The methodology is implemented in full in our play-engine too. The approach appears to be useful in many stages in the development of reactive systems, and might also pave the way to systems that are constructed directly from their requirements, without the need for intra-object or intra-component modeling or coding.

This research was supported in part by the John von Neumann Minerva Center for the Verification of Reactive Systems.

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. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Colloq. Aut. Lang. Prog., volume 372 of Lect. Notes in Comp. Sci., pages 1–17. Springer-Verlag, 1989.

    Google Scholar 

  2. R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. 22nd Int. Conf. on Software Engineering (ICSE’00), Limerick, Ireland, June 2000.

    Google Scholar 

  3. R. Alur, G.J. Holzmann, and D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70–77, 1996.

    MATH  Google Scholar 

  4. R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. 10th Int. Conf. on Concurrency Theory (CONCUR’99), Eindhoven, Netherlands, August 1999.

    Google Scholar 

  5. R. Bharadwaj and C. Heitmeyer. Model Checking Complete Requirements Specifications Using Abstraction. Automated Software Engineering, 6(1):37–68, January 1999.

    Google Scholar 

  6. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2): 142–170, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. W. Damm and D. Harel. LSCs: Breathing Life into Message Sequence Charts. Formal Methods in System Design, 19(1), 2001. (Preliminary version in Proc. 3rdIFIP Int. Conf. on Formal Methods for Open Object-Based Distributed Systems (FMOODS’99), (P. Ciancarini, A. Fantechi and R. Gorrieri, eds.), Kluwer Academic Publishers, 1999, pp. 293–312.).

    Google Scholar 

  8. W. Damm and J. Klose. Verification of a Radio-based Signalling System using the STATE-MATE Verification Environment. Formal Methods in System Design, 19(2):121–141, 2001.

    Article  MATH  Google Scholar 

  9. E.A. Emerson and E.M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241–266, 1982.

    Article  MATH  Google Scholar 

  10. M. Fränzle and K. Lüth. Visual Temporal Logic as a Rapid Prototyping Tool. Computer Languages, 27:93–113, 2001.

    Article  MATH  Google Scholar 

  11. Elsa L. Gunter, Anca Muscholl, and Doron Peled. Compositional message sequence charts. In Tools and Algorithms for Construction and Analysis of Systems, pages 496–511, 2001.

    Google Scholar 

  12. D. Harel. From Play-In Scenarios To Code: An Achievable Dream. IEEE Computer, 34(1):53–60, January 2001. (Also in Fundamental Approaches to Software Engineering (FASE), Lecture Notes in Computer Science, Vol. 1783 (Tom Maibaum, ed.), Springer-Verlag, March 2000, pp. 22–34.).

    Google Scholar 

  13. D. Harel and H. Kugler. Synthesizing State-Based Object Systems from LSC Specifications. Int. J. of Foundations of Computer Science (IJFCS)., 13(1):5–51, Febuary 2002. (Also, Proc. Fifth Int. Conf. on Implementation and Application of Automata (CIAA 2000), July 2000, Lecture Notes in Computer Science, Springer-Verlag, 2000.).

    Google Scholar 

  14. D. Harel and R. Marelly. Specifying and Executing Behavioral Requirements: The Play-In/ Play-Out Approach. Tech. Report MCS01-15, The Weizmann Institute of Science, 2001.

    Google Scholar 

  15. D. Harel and R. Marelly. Playing with Time: On the Specification and Execution of Time-Enriched LSCs. In Proc. 10th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’02), Fort Worth, Texas, 2002. To appear.

    Google Scholar 

  16. D. Harel and M. Politi. Modeling Reactive Systems with Statecharts: The STATEMATE Approach. McGraw-Hill, 1998.

    Google Scholar 

  17. C. Heitmeyer, J. Kirby, B. Labaw, and R. Bharadwaj. SCR*: A Toolset for Specifying and Analyzing Software Requirements. In A.J. Hu and M.Y. Vardi, editors, Proc. 10th Intl. Conference on Computer Aided Verification (CAV’98), volume 1427 ofLect. Notes in Comp. Sci., Springer-Verlag, pages 5–51, 1998.

    Google Scholar 

  18. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. On Message Sequence Graphs and finitely generated regular MSC languages. In Proceedings of the 27th International Colloquium on Automata Languages and Programming (ICALP’2000), number 1853 in Lecture Notes in Computer Science, Geneva, Switzerland, 2000. Springer.

    Chapter  Google Scholar 

  19. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. Regular collections of Message Sequence Charts. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS’2000), number 1893 in Lecture Notes in Computer Science, Bratislava, Slovakia, 2000. Springer-Verlag.

    Google Scholar 

  20. I-logix,inc., products web page. http://www.ilogix.com/fsprod.htm.

  21. ITU. ITU-T recommendation Z.120: Message sequence chart (MSC).

    Google Scholar 

  22. J. Klose and H. Wittke. An automata based interpretation of live sequence chart. In Proc. 7 th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01), 2001.

    Google Scholar 

  23. K. Koskimies, T. Systa, J. Tuomi, and T. Mannisto. Automated support for modeling OO software. IEEE Software, 15(1):87–94, 1988.

    Article  Google Scholar 

  24. I. Kruger, R. Grosu, P. Scholz, and M. Broy. From MSCs to statecharts. In Proc. DIPES’98. Kluwer, 1999.

    Google Scholar 

  25. O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In 2nd International Conference on Temporal Logic, pages 91–106, Manchester, July 1997.

    Google Scholar 

  26. M. Lettrari and J. Klose. Scenario-based monitoring and testing of real-time uml models. In Proc. 4th Int. Conf. on the Unified Modeling Language, 2001.

    Google Scholar 

  27. R. Marelly, D. Harel, and H. Kugler. Multiple Instances and Symbolic Variables in Executable Sequence Charts. In Proc. 17th Ann. ACM Conf. on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA’02), Seattle, WA, 2002. To appear. Also available as Tech. Report MCS02-05, Weizmann Institute of Science, 2002.

    Google Scholar 

  28. Anca Muscholl, Doron Peled, and Zhendong Su. Deciding properties for message sequence charts. In Foundations of Software Science and Computation Structure, pages 226–242, 1998.

    Google Scholar 

  29. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. Princ. of Prog. Lang., pages 179–190, 1989.

    Google Scholar 

  30. A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In In R. Alurand T. Henzinger, editors, Proc. 8 th Intl. Conference on Computer Aided Verification (CAV’96), volume 1102 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 184–195, 1996.

    Google Scholar 

  31. Rational,inc., web page. http://www.rational.com.

  32. B. Selic, G. Gullekson, and P. Ward. Real-Time Object-Oriented Modeling. John Wiley & Sons, New York, 1994.

    MATH  Google Scholar 

  33. UML. Documentation of the unified modeling language (UML). Available from the Object Management Group (OMG), http://www.omg.org.

  34. J. Whittle and J. Schumann. Generating statechart designs from scenarios. In Proc. 22nd Int. Conf. on Software Engineering (ICSE’00), Limerick, Ireland, June 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Weizmann Institute of Science, Rehovot, Israel

    David Harel, Hillel Kugler, Rami Marelly & Amir Pnueli

Authors
  1. David Harel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hillel Kugler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rami Marelly
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, 200 University Avenue West, Waterloo, ON, N2L 3G1, Canada

    Mark D. Aagaard

  2. Strategic CAD Labs, Intel Corporation, 5200 NE ElamYoung Parkway, Hillsboro, OR, 97124-6497, USA

    John W. O’Leary

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harel, D., Kugler, H., Marelly, R., Pnueli, A. (2002). Smart Play-out of Behavioral Requirements. In: Aagaard, M.D., O’Leary, J.W. (eds) Formal Methods in Computer-Aided Design. FMCAD 2002. Lecture Notes in Computer Science, vol 2517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36126-X_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-36126-X_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00116-4

  • Online ISBN: 978-3-540-36126-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation