Skip to main content
SpringerLink
Log in

Simulating guarded programs in linear logic

  • Invited Talk 1
  • Conference paper
  • First Online:
Book cover Theory and Practice of Parallel Programming (TPPP 1994)

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

Included in the following conference series:

Abstract

Petri Nets are one of the most basic formal models for the representations and analysis of concurrent programming. Combining finite automata with non-deterministic Petri net, we introduce a new paradigm of Non-Deterministic Petri Nets with States in order to grasp the non-deterministic cases that can occur within concurrent processes. Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. The guarded commands approach to non-deterministic and parallel programming was introduced by Dijkstra. Based on our (Petri Nets ⇔ Linear Logic) correspondence, we prove that programs built up of guarded commands can be simulated directly within the framework of Horn Linear Logic.

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. S.Abramsky. Computational interpretation of linear logic. Imperial College Research Report DOC 90/20, 1990.

    Google Scholar 

  2. S.Abramsky, Computational Interpretations of Linear Logic, Theoretical Computer Science, v.111, 1992, p.3–57. (Special Issue on the 1990 Workshop on Math. Found. Prog. Semantics.)

    Article  Google Scholar 

  3. A.Asperti, G.-L.Ferrari, and R.Gorrieri. Implicative formulae in the 'proofs as computations' analogy. In Proc. 17-th ACM Symposium on Principles of Programming Languages, San-Francisco, January 1990, p.59–71

    Google Scholar 

  4. A.Brown. Relating Petri Nets to Formulas of Linear Logic. Technical Report. LFCS, Edinburgh, 1989.

    Google Scholar 

  5. E.W.Dijkstra. A Discipline of Programming. 1976.

    Google Scholar 

  6. E.W.Dijkstra. Guarded Commands, Nondeterminacy and Formal Derivation of Programs. In Current Trends in Programming Methodology, Volume 1, Software Specification and Design 1977, p.233–242.

    Google Scholar 

  7. M.R.Garey and D.S.Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.

    Google Scholar 

  8. V.Gehlot and C.A.Gunter. Normal process representatives. In Proc. 5-th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, June 1990.

    Google Scholar 

  9. J.-Y.Girard. Linear logic. Theoretical Computer Science, 50:1, 1987, pp.1–102.

    Article  Google Scholar 

  10. J.-Y.Girard and Y.Lafont. Linear logic and lazy computation, Proceedings of TAPSOFT 87, Springer Lecture Notes in Computer Science n∘257, 1987, pp.52–66.

    Google Scholar 

  11. J.-Y.Girard, A.Scedrov, and P.J.Scott, Bounded Linear Logic: A Modular Approach to Polynomial Time Computability, Theoretical Computer Science, 97, 1992, pp. 1–66.

    Article  Google Scholar 

  12. J.-Y.Girard. Linear logic: a survey, Logic & Algebra of Specification, NATO ASI Series F, 94, eds. Bauer & al., Springer Verlag, 1993.

    Google Scholar 

  13. C.A.Gunter and V.Gehlot. Nets as Tensor Theories. In Proc. 10-th International Conference on Application and Theory of Petri Nets, Bonn, 1989, p.174–191

    Google Scholar 

  14. J.Hopcroft and J.Pansiot, On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science, 8, 1979, pp.135–159

    Article  Google Scholar 

  15. M.I.Kanovich. Horn Programming in Linear Logic is NP-complete. In Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, June 1992, pp.200–210

    Google Scholar 

  16. M.I.Kanovich. Linear logic as a logic of computations, Annals Pure Appl. Logic, 67 (1994) p.183–212

    Article  Google Scholar 

  17. M.I.Kanovich. The complexity of Horn Fragments of Linear Logic, Annals Pure Appl. Logic, 69 (1994) p.195–241. (Special Issue on LICS'92)

    Article  Google Scholar 

  18. M.I.Kanovich. Petri Nets, Horn Programs, Linear Logic, and Vector Games. Proceedings of the International Symposium Theoretical Aspects of Computer Software, TACS'94, Sendai, Japan, April 1994. In Lecture Notes in Computer Science, (ed. M.Hagiya and J.Mitchell), 1994, 789, p.642–666

    Google Scholar 

  19. M.I.Kanovich. Computational and Concurrency Aspects of Linear Logic. Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August–2 September, 1994. In Technology and Foundations, Information Processing '94, Volume 1, (ed. B.Pehrson and I.Simon) 1994, pp. 336–341

    Google Scholar 

  20. R.M.Karp and R.E.Miller. Parallel Program Schemata. Journal of Computer and System Sciences, 3 (1969), pp. 147–195.

    Google Scholar 

  21. R.S.Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14-th Annual Symposium on Theory of Computing, 267–281, 1982. Preliminary Version.

    Google Scholar 

  22. P.Lincoln, J.Mitchell, A.Scedrov, and N.Shankar. Decision Problems for Propositional Linear Logic. Technical Report SRI-CSL-90-08, CSL, SRI International, August 1990. Annals Pure Appl. Logic, 56 (1992) pp. 239–311.

    Article  Google Scholar 

  23. N.Marti-Oliet and J.Mesequer. From Petri Nets to Linear Logic. In: Springer LNCS 389, ed. by D.R.Pitt et al., 1989, p.313–340

    Google Scholar 

  24. E.Mayr and A.Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46, 305–329, 1982.

    Article  Google Scholar 

  25. E.Mayr, An algorithm for the general Petri net reachability problem. SIAM J.Comput., 13, N 3, 441–460, 1984.

    Article  Google Scholar 

  26. T.Murata. Petri Nets: Properties, Analysis, and Applications. Proceedings of the IEEE, vol.77, No.4, p.541–580, 1989.

    Article  Google Scholar 

  27. V.R.Pratt, Event spaces and their linear logic, In AMAST'91: Algebraic Methodology and Software Technology, Iowa City, 1991, Workshops in Computing, 1–23, Springer-Verlag, 1992.

    Google Scholar 

  28. A.S.Troelstra, Lectures on Linear Logic, CSLI Lecture Notes No. 29, Center for the Study of Language and Information, Stanford University, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Mathematical Sciences Graduate School of Information Sciences, Tohoku University, 980, Sendai, Japan

    Max I. Kanovich

  2. Russian Humanities State University, Moscow, Russia

    Max I. Kanovich

Authors
  1. Max I. Kanovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takayasu Ito Akinori Yonezawa

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanovich, M.I. (1995). Simulating guarded programs in linear logic. In: Ito, T., Yonezawa, A. (eds) Theory and Practice of Parallel Programming. TPPP 1994. Lecture Notes in Computer Science, vol 907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026564

Download citation

  • DOI: https://doi.org/10.1007/BFb0026564

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59172-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation