Skip to main content
Springer Nature Link
Log in

Towards a theory of simulation for verification of concurrent systems

  • Submitted Presentations
  • Conference paper
  • First Online:
PARLE '89 Parallel Architectures and Languages Europe (PARLE 1989)

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

  • 133 Accesses

Abstract

We here investigate whether it is possible to provide the designer of a concurrent system with a sound and efficient simulation technique enabling reasoning about important behavioural properties of the system. We introduce the notion of a simulation defined as a subset of the possible execution paths generated by the system, and demonstrate that under some conditions the simulation provides a sufficient information to reason about a number of interesting properties of the system. We then show that there always exists a simulation which provides the required behavioural information and involves a minimal computational effort.

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

Access this chapter

Log in via an institution

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. Bertholet G. and Terrat R., Petri Net Theory for the Correctness of Protocols, IEEE Transactions on Communications, Vol. COM-30, 1982.

    Google Scholar 

  2. Best E. and Devillers R., Concurrent Behaviour: Sequences, Processes and Programming Languages, GMD-Studien Nr. 99, GMD, Bonn, 1985.

    Google Scholar 

  3. Billington J., Wheeler G.R. and Wilbur-Ham M.C., PROTEAN: A High-Level Net Tool for the Specification and Verification of Communication Protocols, IEEE Transactions on Software Engineering, Vol. 14, No.3, 1988.

    Google Scholar 

  4. Brookes S.D., Hoare C.A.R. and Roscoe A.W., A Theory of Communicating Sequential Processes, JACM, Vol.31, 1984, pp.560–599.

    Google Scholar 

  5. Browne M.C., An Improved Algorithm for the Automatic Verification of Finite State Systems using Temporal Logic, Report, CMU-CS-86-156, Carnegie-Mellon University, 1986.

    Google Scholar 

  6. Clarke E.M., Emerson E.A. and Sistla A.P., Automatic Verification of Finite-State Systems using Temporal Logic Specifications, TOPLAS, Vol.8, 1986, pp.244–263.

    Google Scholar 

  7. Gostelow K. et. al, Proper Termination of Flow Control in Programs Involving Concurrent Processes, SIGPLAN Notices, Vol.7, No.11, 1972.

    Google Scholar 

  8. Hack M., Analysis of Production Schemata by Petri Nets, MIT, MAC, Comp. Stru. Note 17, 1974.

    Google Scholar 

  9. Hennessy M. and Milner R., Algebraic Laws for Nondeterminism and Concurrency, JACM, Vol.32, 1985, pp.136–161.

    Google Scholar 

  10. Hoare C.A.R., Communicating Sequential Processes, Prentice-Hall, 1985.

    Google Scholar 

  11. Holzmann G.J., Automated Protocol Verification and Automatic Implementation of Communication Protocols, IEEE Transactions on Software Engineering, Vol. SE-12, No.8, 1986.

    Google Scholar 

  12. Inmos Ltd., occam Programming Manual, Prentice-Hall, 1985.

    Google Scholar 

  13. Janicki R., Nets, Sequential Components and Concurrency Relations, Theoretical Computer Science 29 (1984), pp. 87–121.

    Google Scholar 

  14. Janicki R., Lauer P.E., Koutny M., Devillers R., Concurrent and Maximally Concurrent Evolution of Non-Sequential Systems, Theoretical Computer Science 43(1986), pp. 213–238.

    Google Scholar 

  15. Keller R.M., Formal Verification of Concurrent Programs, CACM, Vol.19, No.7, pp.371–384, 1976.

    Google Scholar 

  16. Koutny M., Adequacy-Preserving Transformations of COSY Path Programs, in: Concurrency 88, F.H. Vogt (Ed.), Lecture Notes in Computer Science, vol.335, 368–379, 1988.

    Google Scholar 

  17. Lallement G., Semigroups and Combinatorial Applications, J. Wiley & Sons, New York 1979.

    Google Scholar 

  18. Lauer P.E., Shields M.W., Cotronis J.Y., Formal Behavioural Specification of Concurrent Systems without Globality Assumptions, Lecture Notes in Computer Science, vol. 107, Springer 1981, pp. 115–151.

    Google Scholar 

  19. Manna Z. and Pnueli A., How to Cook a Temporal Proof System for Your Pet Language, Proc. POPL'83, 1983.

    Google Scholar 

  20. Martinez J. and Silva M., "A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net", Proc. Second European Workshop on Application and Theory of Petri Nets, 1982.

    Google Scholar 

  21. Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, Report DAIMI PB-78, Dept. of Computer Science, Aarhus Univ. Publ., 1977.

    Google Scholar 

  22. Milner R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer 1980.

    Google Scholar 

  23. Morgan E.T and Razouk R.R., Interactive State-Space Analysis of Concurrent Systems, IEEE Transactions on Software Engineering, Vol. SE-13, No. 10, 1987.

    Google Scholar 

  24. Murata T. and Suzuki I., On the Structural Properties Properties and Stepwise Refinment of Petri Nets, Proc. 24th Midwest Symposium on Circuit and Systems, 1981.

    Google Scholar 

  25. Peterson J.L., Petri Net Theory and the Modeling of Systems, Prentice Hall, 1981.

    Google Scholar 

  26. Pinter S.S. and Wolper P., A Temporal Logic to Reason about Partially Ordered Computations, Proc. 3rd ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, 1984, pp. 28–37.

    Google Scholar 

  27. Reisig W., Petri Nets, Springer 1985.

    Google Scholar 

  28. Salwicki A., Müldner T., On Algorithmic Properties of Concurrent Programs, Lecture Notes in Computer Science, vol. 125, Springer 1981, pp. 169–197.

    Google Scholar 

  29. Shields M.W., Adequate Path Expressions, Lecture Notes in Computer Science, vol. 70, Springer 1979, pp. 249–265.

    Google Scholar 

  30. Shields M.W., Concurrent Machines, The Computer Journal 28,5(1985), pp. 449–465.

    Google Scholar 

  31. Taylor R.N., A General-Purpose Algorithm for Analyzing Concurrent Programs, CACM, Vol. 26, No.5, pp. 362–376, 1983.

    Google Scholar 

  32. Zielonka W., Notes on Finite Asynchronous Automata, Informatique Théorique et Applications, Vol. 21, No. 2, 1987, pp. 99–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Systems, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    Ryszard Janicki

  2. Computing Laboratory, The University of Newcastle upon Tyne, NE1 7RU, Newcastle upon Tyne, U.K.

    Maciej Koutny

Authors
  1. Ryszard Janicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eddy Odijk Martin Rem Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janicki, R., Koutny, M. (1989). Towards a theory of simulation for verification of concurrent systems. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-51285-3_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51285-1

  • Online ISBN: 978-3-540-46184-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics