Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1996: CONCUR '96: Concurrency Theory pp 498–513Cite as

Linear constraint systems as high-level nets

  • Conference paper
  • First Online:

  • 139 Accesses

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

Abstract

Linear constraint systems are simple deductive systems based on the main underlying idea of linear logic: hypotheses represent physical resources which are consumed by the entailment relation. For such systems, we define back-and-forth translations into a class of high-level Petri nets. Using the specific properties of that class of nets, and previous results about the complexity of the reachability problem for such nets, we examine the complexity of the entailment problem for finitely generated linear constraint systems and we show that it is NP-complete.

This work is supported by the HCM project EXPRESS.

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. B. Baumgarten: Petri-Netze. Grundlagen und Anwendungen. BI-Verlag, 1990.

    Google Scholar 

  2. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel and E. Pelz: A Class of Composable High Level Petri Nets. Proc. of 16th ICPN, LNCS Vol.935, Springer Verlag, 103–120, 1995.

    Google Scholar 

  3. F.S. de Boer and C. Palamidessi: Embedding as a Tool for Language Comparison. Information and Computation 108(1):128–157, 1994.

    Google Scholar 

  4. F.S. de Boer, C. Palamidessi and E. Best: Concurrent Constraint Programming with Information Removal. Proc. First Intl. Workshop on Concurrent Constraint Programming, Venice, 1–13, May 1995.

    Google Scholar 

  5. C. Brown and D. Gurr: A Categorical Linear Framework for Petri Nets. Proc. Fifth Annual IEEE Symposium on Logic in Computer Science, Philadelphia, IEEE Comput. Soc. Press, 208–218, 1990.

    Google Scholar 

  6. N. Carriero and D. Gelernter: Linda in Context. Comm. ACM32(4):445–458, 1989.

    Google Scholar 

  7. S. Christensen, Y. Hirshfeld and F. Moller: Bisimulation Equivalence is Decidable for Basic Parallel Processes. Proc. CONCUR'93, LNCS Vol.715, Springer Verlag, 143–175, 1993.

    Google Scholar 

  8. U. Engberg and G. Winskel: Petri Nets as Models of Linear Logic. Proc. 15th Colloquium on Trees in Algebra and Programming, LNCS Vol.431, Springer-Verlag, 147–161, 1990.

    Google Scholar 

  9. J. Esparza: Petri Nets, Commutative Context-free Grammars and Basic Parallel Processes. Proc. FCT'95, LNCS Vol.965, Springer Verlag, 221–232, 1995.

    Google Scholar 

  10. H.J. Genrich: Predicate-transition Nets. In Petri Nets: Central Models and their Properties, LNCS Vol.254, Springer-Verlag, 207–247, 1987.

    Google Scholar 

  11. K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1. EATCS Monographs on Theoretical Computer Science, 1992.

    Google Scholar 

  12. D. Gelernter: Generative Communication in Linda. ACM TOPLAS 7(1):80–112, 1985.

    Google Scholar 

  13. U. Montanari and F. Rossi: Concurrent Semantics for Concurrent Constraint Programming via Contextual Nets. In V. Saraswat and P. Van Entenryck (eds) Constraint Programming. The MIT Press, 1995.

    Google Scholar 

  14. W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer-Verlag (1985).

    Google Scholar 

  15. W. Reisig: Petri Nets and Algebraic Specifications. Theoretical Computer Science 80, 1–34, 1991.

    Google Scholar 

  16. V.A. Saraswat and M. Rinard: Concurrent Constraint Programming. Proc. seventeenth ACM Symposium on Principles of Programming Languages, 232–245, ACM, New York, 1990.

    Google Scholar 

  17. V.A. Saraswat, M. Rinard, and P. Panangaden: Semantics Foundations of Concurrent Constraint Programming. Proc. eighteenth ACM Symposium on Principles of Programming Languages, ACM, New York, 1991.

    Google Scholar 

  18. D. Scott: Domains for Denotational Semantics. Proc. ICALP, Springer Verlag, 1982.

    Google Scholar 

  19. J. Vautherin: Parallel Systems Specification with Colored Petri Nets and Algebraic Specification. LNCS Vol. 266, Springer-Verlag, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Hildesheim, Marienburger Platz 22, D-31141, Hildesheim, Germany

    Eike Best

  2. DISI, Università di Genova, Via Dodecaneso, 35, I-16146, Genova, Italy

    Catuscia Palamidessi

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Catuscia Palamidessi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E., Palamidessi, C. (1996). Linear constraint systems as high-level nets. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61604-7

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation