Skip to main content
SpringerLink
Log in

Combining Petri Nets and other formal methods

  • Invited Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1992 (ICATPN 1992)

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

Included in the following conference series:

Abstract

Several practically important concepts, supporting proper treatment of concurrency, have evolved during the recent years. Many of them have been presented in formal settings different from Petri Nets. In this paper we exemplify some of those concepts and relate them to the state-of-the-art in Petri Nets.

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.

References

  1. M. Abadi, L. Lamport, P. Wolper. Realizable and Unrealizable Specifications of Reacitve Systems. 16th ICALP, LNCS 372, Springer-Verlag pp 1–17 (1989).

    Google Scholar 

  2. Martin Abadi, Leslie Lamport: Composing Specifications. In: Stepwise Refinement of Distributed Systems, LNCS 430, Springer-Verlag, pp. 1–41 (1990).

    Google Scholar 

  3. Bowen Alpern, Fred B. Schneider: Defining Liveness. Information Processing Letters 21, pp. 181–185 (1985).

    MathSciNet  Google Scholar 

  4. R.-J. Back, R. Kurki-Suonio: Distributed Cooperation with Action Systems. ACM Transactions on Programming Languages and Systems, Vol. 10 No. 4, pp. 513–554 (1988).

    Article  Google Scholar 

  5. R.-J. Back, R. Kurki-Suonio: Decentralization of process nets with centralized control. Distr. Computing 3, pp. 73–87 (1989).

    Article  Google Scholar 

  6. G. Berry, G. Boudol: The Chemical Abstract Machine. Proc. 17th Annual Symp. on Principles of Programming Languages (1990).

    Google Scholar 

  7. Eike Best: Fairness and Conspiracies. Information Processing Letters 18, pp. 215–220 (1984).

    Google Scholar 

  8. E. Best, R. Devillers, A. Kiehn, L. Pomello: Concurrent Bisimulations in Petri Nets. Acta Informatica 28/3, pp. 231–264 (1991).

    Google Scholar 

  9. Eike Best, Javier Esparza, Maciej Koutny: Operational Semantics for the Box Algebra. Manuscript (1982).

    Google Scholar 

  10. F.S. de Boer: Compositionality in the temporal logic of concurrent systems (extended abstract). Further Generation Computer Systems 6, pp. 287–299 (1990).

    Google Scholar 

  11. Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: Observing Localities. INRIA Rapport de Recherche No. 1485, July 1991.

    Google Scholar 

  12. Manfred Broy: A theory for nondeterminism, parallelism, communication and concurrency. Theoretical Computer Science 54, pp. 1–68 (1986).

    Google Scholar 

  13. Manfred Broy: Towards a Design Methodology for Distributed Systems. In: M. Broy (ed). Constructive Methods in Computing Science. NATO ASI Series F: Computer and System Sciences, Vol. 55, pp. 311–364 (1989).

    Google Scholar 

  14. Manfred Broy: On the Design and Verification of a Simple Distributed Spanning Tree Algorithm SFB-Bericht Nr. 342/24/90A, TU München (1990).

    Google Scholar 

  15. Manfred Broy: Functional Specification of Time sensitive communicating systems. In: J.W. de Bakker et al: Stepwise Refinement of Distr. Systems. LNCS Vol. 430 (1990).

    Google Scholar 

  16. Manfred Broy, Frank Dederichs, Claus Dendorfer, Max Fuchs, Thomas F. Gritzner, Rainer Weber: The Design of Distributed Systems — An Introduction to FOCUS, unpublished manuscript (1991).

    Google Scholar 

  17. K.M. Chandy, Leslie Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM Transaction on Computer Systems Vol. 3 No. 1, pp. 63–75 (1985).

    Google Scholar 

  18. K.M. Chandy, J. Misra: Parallel Program Design. Addison-Wesley (1988).

    Google Scholar 

  19. Bernadette Charron-Bost: Concerning the Size of Clocks, LNCS Vol. 469, pp. 176–184 (1990).

    Google Scholar 

  20. B. Cohen, W.T. Harwood, M.I. Jackson: The Specification of Complex Systems. Addison Wesley (1986).

    Google Scholar 

  21. Frank Dederichs, Rainer Weber: Safety and Liveness from a Methodological Point of View. IPL 36, pp. 25–30 (1990).

    Google Scholar 

  22. P. Degano, R. de Nicola, U. Montanari: A Distributed Operational Semantics for CCS based on Condition/Event Systems. Acta Informatica 26, pp. 59–91 (1988).

    Google Scholar 

  23. P. Degano, R. de Nicola, U. Montanari: A Partial Ordering Semantics for CCS. TCS 75, pp. 223–262 (1990).

    Google Scholar 

  24. Jörg Desel: On the Power of Place-Invariants. Petti Net Newsletter 40, pp. 5–6 (1991).

    Google Scholar 

  25. E.W. Dijkstra, W.H.J. Feijen, A.J.M van Gasteren: Derivation of a termination detection algorithm for distributed computations, Information Processing Letters 16, pp. 217–219 (1983).

    Article  Google Scholar 

  26. E.W. Dijkstra, C.S. Scholtern: Termination Detection for Diffusing Computations. Inf. Proc. Letters 11, No. 1, pp. 217–219 (1980).

    Google Scholar 

  27. Rainer Durchholz: Causality, Time and Deadlines. Data & Knowledge Engineering 6, North-Holland, pp. 469–477 (1991).

    Google Scholar 

  28. Nissim Francez: Fairness. Springer-Verlag (1986).

    Google Scholar 

  29. Rob Gerth, Ruard Kuiper, John Segers: Interface Refinement in Reactive Systems. unpublished (1992).

    Google Scholar 

  30. Ursula Goltz, Rob van Glabbeek: Equivalence Notions for Concurrent Systems and Refinement of actions. 14th MFCS LNCS 379, pp. 237–248, Springer-Verlag (1988).

    Google Scholar 

  31. Ursula Goltz, Rob van Glabbeek: Refinement of Action in Causality Based Models. REX-Workshop on Stepwise Refinement of Distributed Systems. LNCS 430, pp. 267–300, Springer-Verlag (1990).

    Google Scholar 

  32. Ursula Goltz, Wolfgang Reisig: Logics for Distributed Systems. Abstracts of a workshop. GMD, Internal Report (1992).

    Google Scholar 

  33. Dominik Gomm, Ekkart Kindler, Barbara Paech, Rolf Walter. Liveness in Nets: Compositionality, Partial Order and Progress Leads to “Changes to”, to appear.

    Google Scholar 

  34. Dominik Gomm, Ekkart Kindler: A Weakly Coherent Virtually Shared Memory Scheme: Formal Specification and Analysis SFB-Bericht No. 342/5/91B, TU Munich (1991).

    Google Scholar 

  35. Dominik Gomm, Rolf Walter: The Distributed Termination Problem: Formal Solution and Correctness Based on Petri Nets. LNCS 464, pp. 159–168 (1990).

    Google Scholar 

  36. Roberto Gorieri, Ugo Montanari: SCONE: A simple calculus of nets. In: CONCUR 90, LNCS 458, pp. 2–30, Springer-Verlag (1990).

    Google Scholar 

  37. Jeremy Gunawardena: Causal Automata I: Confluence=OR−Causality. In: M.Z. Kwiatkowska et al (eds.): Semantics for Concurrency. Leicester Workshop in computing 1990, pp. 137–156, Springer-Verlag (1990).

    Google Scholar 

  38. David Hard: Statecharts: A visual formalism for complex systems. In: Science of Computer Programming 8, pp. 231–274 (1987).

    Google Scholar 

  39. David Harel, Amir Pnueli: On the Development of Reactive Systems. In: K. Apt (ed.): Logics and Models of Concurrent Systems.

    Google Scholar 

  40. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall (1985).

    Google Scholar 

  41. A.W. Holt, F. Commoner: Events and Conditions. Princeton, N.J., Applied Data Research Inc., Inf. Syst. Theory Project (1970).

    Google Scholar 

  42. A.W. Holt, H. Saint, R. Shapiro, S. Warshall: Final Report of the Information Systems. Theory Project unpublished.

    Google Scholar 

  43. Paritosh K. Pandya: Some comments on the assumption-commitment framework for compositional verification of distributed programs, de Bakker, de Roever, Rozenberg (eds.): Stepwise Refinement of Distributed Systems. LNCS 430, Springer-Verlag, pp. 622–640(1990).

    Google Scholar 

  44. Wil Janssen, Manes Poel, Job Zwiers: Action Systems and Action Refinement in the Development of Parallel Systems. CONCUR 91, LNCS 527 (1991).

    Google Scholar 

  45. David R. Jefferson: Virtual Time. ACM Transactions on Programming Languages and Systems, Vol. 7 No. 3, pp. 404–425.

    Google Scholar 

  46. Alan Jeffry: Abstract timed observation and process algebra. CONCUR 91, LNCS 527, pp. 332–345 (1991).

    Google Scholar 

  47. Cliff B. Jones: Tentative steps toward a development method for interfering programs. ACM transactions on programming languages and systems, Vol. 5 No. 4, pp. 596–619 (1983).

    Article  Google Scholar 

  48. Bengt Jonsson: A model and proof system for asynchronous networks. 4th ACM Symposium on Principles of Distributed Computing, Minaki, Canada, pp. 49–58 (1985).

    Google Scholar 

  49. Bengt Jonsson: A Hierarchy of Compositional Models of I/0-Automata MFCS 1990, LNCS 452, pp. 347–354 (1990).

    Google Scholar 

  50. Gilles Kahn: The Semantics of a Simple Language for Parallel Programming. In: Information Processing 74, North-Holland Publ. Comp., pp. 471–475 (1974).

    Google Scholar 

  51. R.M. Keller: Formal Verification of Parallel Programs. Comm. of the ACM 19, No. 7, pp. 371–384 (1976).

    Google Scholar 

  52. Ekkart Kindler, Wolfgang Reisig: Characterization and Analysis of Distributed Systems by Petri Net Specifications. Internal Report, TU München, to appear.

    Google Scholar 

  53. Ajay D. Kshemkalyani, Mukesh Singhal: Invariant Based Verification of a Distributed Deadlock Detection Algorithm IEEE Transactions on Software Engineering, Vol. 17 No. 8, pp. 789–799 (1981).

    Google Scholar 

  54. Leslie Lamport: Proving the Correctness of multiprocess programs. IEEE Transactions on Software Engineering. No. 2, pp. 125–143 (1977).

    Google Scholar 

  55. Leslie Lamport: Time, Clocks and the ordering of events in a Distributed System. Communications of the ACM 21, No. 7, pp. 558–565 (1978).

    Article  Google Scholar 

  56. Leslie Lamport: An assertional correctness proof of a distributed algorithm. Science of Computer Programming 2, pp. 175–206 (1982).

    Article  Google Scholar 

  57. Leslie Lamport: Basic Concepts. in: Advanced Course on Distributed Systems — Methods and Tools for Specification. Lecture Notes in Computer Science 190, Springer-Verlag, pp. (1984).

    Google Scholar 

  58. Leslie Lamport: Concurrent Reading and Writing of Clocks. ACM transact. on Computer Systems Vol. 8 No. 4, pp. 305–310 (1990).

    Google Scholar 

  59. Leslie Lamport, Nancy Lynch: Distributed Computing. in: Handbook of Theoretical Computer Science, Vol. B, Elsevier, pp. 1157–1199 (1990).

    Google Scholar 

  60. Kim G. Larsen, Bent Thomsen: Partial specifications and compositional verification. TCS 88, pp. 15–32 (1991).

    Google Scholar 

  61. N.A.Lynch, R.M. Tuttle: Hierarchical Correctness proofs for distributed algorithms. 6th ACM Symposium on Principles of Distributed Computing, pp. 137–151 (1987).

    Google Scholar 

  62. Zohar Manna, Amir Pnueli: The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag (1991).

    Google Scholar 

  63. Friedhelm Mattern: Virtual Time and Global States in Distributed Systems. In: M. Cosnard (ed.) Proc. of Parallel and Distributed Algorithms, Elsevier (1988).

    Google Scholar 

  64. Sigurd Meldal, Sriram Sankar, James Vera: Exploiting Locality in Maintaining Potential Causality. Technical Report CSL-TR-91-466, Computer Systems Laboratory, Stanford University (1991).

    Google Scholar 

  65. Robin Milner: Communication and Concurrency. International Series in Computer Science. Prentice Hall (1989).

    Google Scholar 

  66. R. Milner, J. Parrow, D. Walker. A Calculus of Mobile Processes, Part I and II, Edinburgh University, Lab. for the foundations of Computer Science, TR ECS-LFCS-89-85 and-86 (1989).

    Google Scholar 

  67. David Murphy: Testing, Betting and Timed True Concurrency. CONCUR 91, LNCS 527, pp 439–454 (1991).

    Google Scholar 

  68. Doris Nolte, Lutz Priese: Fairness in Models with True Concurrency CONCUR 91, LNCS 527, pp. 455–469.

    Google Scholar 

  69. Ernst-Rüdiger Olderog: Operational Petri Net semantics for CCSP. In: G. Rozenberg (ed.) Advances in Petri Nets 1987, LNCS 266, pp. 196–223, Springer-Verlag (1987).

    Google Scholar 

  70. Ernst-Rüdiger Olderog: Nets, Terms, Formulas. Cambridge University Press (1990).

    Google Scholar 

  71. Susan Owicki, David Gries: An axiomatic proof technique of parallel programs. Acta Informatica 6 (1976).

    Google Scholar 

  72. Paritosh K. Pandya: Some comments on the assumption-commitment framework for compositional verification of distributed programs, de Bakker, de Roever, Rozenberg (eds.): Stepwise Refinement of Distributed Systems. LNCS 430, Springer-Verlag, pp. 622–640 (1990).

    Google Scholar 

  73. P.K. Pandya, M. Joseph: P-Alogic — a compositional proof system for distributed programs. Distr. Computation 5, pp. 37–54 (1991).

    Google Scholar 

  74. Carl-Adam Petri: Kommunikation mit Automaten. PhD Dissertation, University of Darmstadt (1962).

    Google Scholar 

  75. Carl-Adam Petri: Non-sequential processes. Internal Report GMD-ISF-77-5 (1977).

    Google Scholar 

  76. Vaughan Pratt: Modelling Concurrency with Partial Orders. International Journal of Parallel Programming, 15, 1, pp. 31–71 (1986).

    Google Scholar 

  77. W. Reisig: Partial Order Semantics versus Interleaving Semantics for CSP-like languages and its Impact on Fairness. ICALP 1984, LNCS 172, pp. 403–413 (1984).

    Google Scholar 

  78. W. Reisig: Concurrent Temporal Logic SFB-Report 342/7/91B, TU München (1991).

    Google Scholar 

  79. W. Reisig: Parallel Composition of Liveness SFB-Report 342/30/91A, TU München (1991).

    Google Scholar 

  80. W.P. de Roever: The quest for compositionality — a survey of assertion based proof systems for concurrent programs Part I — In: Proc. of the IFIP Conference “The role of abstract models in Computer Science (Neuhold, ed.) North-Holland, (1985).

    Google Scholar 

  81. W.P. de Roever: Foundations of Computer Science: Leaving the Ivory Tower. Institut für Informatik und Praktische Mathematik Universität Kiel, Interner Bericht Nr. 9105 (1991) also in Bulletin of the EATCS.

    Google Scholar 

  82. Reinhard Schwarz, Friedemann Mattern: Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail. Univ. Kaiserslautern, Fachbereich Informatik. Internal Report No. 215/91 (1991).

    Google Scholar 

  83. A.P. Sistla: Proving Correctness with respect to nondeterministic safety specifications. IPL 39, pp. 45–49 (1991).

    MathSciNet  Google Scholar 

  84. Einar Smith: Kausalität und Temporalität bei der Modellbildung. 4, Symposium Simulationstechnik, Informatik-Fachbericht 150, pp. 127–134, Springer-Verlag (1987).

    Google Scholar 

  85. E.W. Stark: Foundations of a Theory of Specifications for Distributed Systems. PhD thesis, MIT Report/LCS/TR-342 (1984).

    Google Scholar 

  86. Gerard Tel: Topics in Distributed Algorithms. Cambridge International Series on Parallel Computation, Vol. 1, Cambridge University Press (1991).

    Google Scholar 

  87. Dirk Taubner: Finite representations of CCS and TCSP programs by automata and Petri Nets. LNCS 369, Springer-Verlag (1989).

    Google Scholar 

  88. Rüdiger Valk: Infinite Behaviour and Fairness. LNCS 254, Springer-Verlag, pp. 377–396 (1987).

    Google Scholar 

  89. Chris A. Vissers, Guiseppe Scollo, Martin van Sinderen, Ed. Brinksma: Specification styles in distributed systems design and verification. TCS 89, pp. 176–206 (1991).

    Google Scholar 

  90. Walter Vogler: Failure Semantics Based on Interval Semiwords is a Congruence for Refinement. Distributed Computing 4, pp. 139–162 (1991).

    Google Scholar 

  91. Klaus Voss: Interface as a Basic Concept for Systems Specification and Verification. In: Concurrency and Nets, Voss et al (eds.) pp, 585–604 (1987), Springer-Verlag.

    Google Scholar 

  92. J. Welch, L. Lamport, N. Lynch: A lattice-structured proof technique applied to a minimal spanning tree algorithm. Proceedings 7th ACM Symp. on Principles of Programming Languages (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität München, Germany

    W. Reisig

Authors
  1. W. Reisig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Jensen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reisig, W. (1992). Combining Petri Nets and other formal methods. In: Jensen, K. (eds) Application and Theory of Petri Nets 1992. ICATPN 1992. Lecture Notes in Computer Science, vol 616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55676-1_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-55676-1_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47270-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation