High-level nets and linear logic

  • Johan Lilius
Submitted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 616)


We show how algebraic high-level nets give rise to a model of intuitionistic predicate linear logic. This construction extends the correspondence between intuitionistic linear logic (ILL) and Petri nets. The model is constructed in several steps. First it is shown how a Petri net gives rise to a model of ILL. This construction is proved to be functorial. Then we show how an algebraic high-level net gives rise to a Petri net and prove that the construction is functorial. The wanted model is then arrived at through the composition of the two functors. Finally we show as an example how to express an algebraic high-level net as a set of intuitionistic predicate linear logic formulas.


Analysis and synthesis structure and behavior of nets higherlevel net models 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abramsky, S. Linear process logic. Notes by Steven Vickers, 1988.Google Scholar
  2. 2.
    Brown, C. Linear logic and Petri nets: Categories, algebra and proof. PhD thesis, Department of Computer Science, University of Edinburgh, Scotland, 1991.Google Scholar
  3. 3.
    Dimitrovici, C. and Hummert, U. Kategorielle konstruktionen für algebraische Petrinetze. Technical Report 23. Fachbereich Informatik, Technische Universität Berlin, 1989.Google Scholar
  4. 4.
    Ehrig, H. and Mahr, B. Fundamentals of algebraic specification I: Equations and initial semantics. Springer-Verlag, Berlin, 1985.Google Scholar
  5. 5.
    Engberg, U. and Winskel, G. Petri nets as models of linear logic. Technical Report DAIMI PB-301. Computer Science Department, Aarhus University, Denmark, 1990.Google Scholar
  6. 6.
    Gallier, J. H. Logic for computer science. John Wiley & Sons, New York, 1987.Google Scholar
  7. 7.
    Genrich, H. Predicate/transition nets. Petri Nets: Central Models and Their Properties. Lecture Notes in Computer Science 254. Springer Verlag, 1986, pp. 207–247.Google Scholar
  8. 8.
    Girard, J.-Y. Linear logic. Theoretical Computer Science, 50(1987), pp. 1–102.CrossRefGoogle Scholar
  9. 9.
    Girard, J.-Y. Quantifiers in linear logic. Proc. of the SILFS Conference, Cesena, Italy. January 1987.Google Scholar
  10. 10.
    Girard, J.-Y. Geometry of interaction I: Interpretation of system F. Logic Colloquium '88. North-Holland, Amsterdam, 1989.Google Scholar
  11. 11.
    Girard, J.-Y. Geometry of interaction II: Deadlock-free algorithms. COLOG 1988. Lecture Notes in Computer Science 417. Springer-Verlag, Berlin, 1990.Google Scholar
  12. 12.
    Girard, J.-Y., Lafont, Y., and Taylor, P. Proofs and types. Cambridge University Press, England, 1989.Google Scholar
  13. 13.
    Goguen, J. A. and Burstall, R. Institutions: Abstract model theory for specification and programming. Research Report ECS-LFCS-90-106. Laboratory for Foundations of Computer Science, University of Edinburgh, Scotland, 1990.Google Scholar
  14. 14.
    Lilius, J. On the compositionality and analysis of algebraic high-level nets. Research Report A16. Digital Systems Laboratory, 1991.Google Scholar
  15. 15.
    Marti-Oliet, N. and Meseguer, J. From Petri nets to linear logic. Category Theory and Computer Science. Lecture Notes in Computer Science 389. Springer Verlag, Berlin, 1989, pp. 313–340.Google Scholar
  16. 16.
    Meseguer, J. and Montanari, U. Petri nets are monoids. Research Report SRI-CSL-88-3R. SRI International, Menlo Park, 1988.Google Scholar
  17. 17.
    Mulvey, C. J. &. Rendiconti del Circolo Matematico di Palermo, 12(1986), pp. 99–104.Google Scholar
  18. 18.
    Niefield, S. B. and Rosenthal, K. I. Constructing locales from guantales. Mathematical Proceedings of the Cambridge Philosophical Society, 104 (1988), pp. 215–234.Google Scholar
  19. 19.
    Reisig, W. and Vautherin, J. An algebraic approach to high level Petri nets. 8th Workshop on Applications and Theory of Petri Nets. Zaragoza, Spain, 1987, pp. 51–72.Google Scholar
  20. 20.
    Reisig, W. Petri nets and algebraic specifications. Theoretical Computer Science, 80(1991), pp. 1–34.Google Scholar
  21. 21.
    Yetter, D. N. Quantales and (noncommutative) linear logic. Journal of Symbolic Logic, 55(1990), pp. 41–64.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Johan Lilius
    • 1
  1. 1.Digital System LaboratoryHelsinki University of TechnologyEspooFinland

Personalised recommendations