Skip to main content

Communication as unification in the Petri Box Calculus

  • Communications
  • Conference paper
  • First Online:

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

Abstract

A way of handling abstract data types in the Petri Box Calculus [BDH92] is proposed. Semantic objects are A-nets, a kind of algebraic nets with Boxe like interfaces. The synchronization operation on A-nets is discussed and some basic (non-trivial) algebraic properties of the synchronization with syntactic unification are shown.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Astesiano and G. Reggio. Algebraic specification of concurrency. In Recent Trends in Data Type specification, LNCS 655, 1993.

    Google Scholar 

  2. E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri Box Calculus. In STACS'93, LNCS 665, 1993.

    Google Scholar 

  3. E. Best, R. Devillers, and J. Hall. The box calculus: a new causal algebra with multi-label communication. In Advances in PN-92, LNCS 609, 1992.

    Google Scholar 

  4. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. To appear in ICPN-95, Torino, LNCS, June 1995.

    Google Scholar 

  5. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A High Level Petri Net Semantics of B(PN) 2. To appear in WiC Springer, STRICT-95, Berlin, May 1995.

    Google Scholar 

  6. E. Best and R.P. Hopkins. B(PN)2 — A Basic Petri Net Programming Notation. In PARLE-93, LNCS 694, 1993.

    Google Scholar 

  7. R. Devillers. On a more liberal synchronization operator for the Petri Box Calculus. LIT TR 281, Université Libre de Bruxelles, May 1993.

    Google Scholar 

  8. R. Devillers and H. Klaudel. Refinement and Recursion in a High Level Petri Box Calculus. To appear in WiC Springer, STRICT-95, Berlin, May 1995.

    Google Scholar 

  9. W. Fraczak and H. Klaudel. A multi-action synchronization schema and its application to the PBC. In ESDA-94, ASME, July 1994.

    Google Scholar 

  10. J.A. Goguen, J.W. Thatcher, and E.G. Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Current Trends in Programming Methodology, vol. 4, Prentice-Hall, 1978.

    Google Scholar 

  11. H. Klaudel and E. Pelz. Communication as Unification in the Petri Box Calculus. LRI TR 967, Université Paris-Sud, Orsay, April 1995.

    Google Scholar 

  12. W. Reisig. Petri nets and algebraic specifications. TCS, vol. 80, 1991.

    Google Scholar 

  13. J. Vautherin. Parallel systems specification with colored Petri nets and algebraic specification. In Advances in PN 1987, LNCS 266, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klaudel, H., Pelz, E. (1995). Communication as unification in the Petri Box Calculus. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44770-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics