Linear constraint systems as high-level nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1119, Issue , 1996, Pages 498-513

  Best, Eike ^a   Palamidessi, Catuscia ^b  

^a UNIVERSITY OF HILDESHEIM   (Germany)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEDUCTIVE SYSTEMS; HIGH-LEVEL NETS; HIGH-LEVEL PETRI NETS; LINEAR CONSTRAINTS; LINEAR LOGIC; PHYSICAL RESOURCES; REACHABILITY PROBLEM; SPECIFIC PROPERTIES;

PETRI NETS;

EID: 84955608992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_72     Document Type: Conference Paper

References (19)

1. B. Baumgarten: Petri-Netze. Grundlagen und Anwendungen. Bl-Verlag, 1990.
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..
3. F.S. de Boer and C. Palamidessi: Embedding as a Tool for Language Comparison. Information and Computation 108(1):128-157, 1994.
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.
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.
6. N. Carriero and D. Gelernter: Linda in Context. Comm. ACM32(4):445-458,1989.
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.
8. [1]U. Engberg and G. Winskel: Petri Nets as Models of Linear Logic. Proc. 15th Colloquium on TYees in Algebra and Programming, LNCS Vol.431, Springer-Verlag, 147-161, 1990.
9. J. Esparza: Petri Nets, Commutative Context-free Grammars and Basic Parallel Processes. Proc. FCT’95, LNCS Vol.965, Springer Verlag, 221-232, 1995.
10. H.J. Genrich: Predicate-transition Nets. In Petri Nets: Central Models and their Properties, LNCS Vol.254, Springer-Verlag, 207-247, 1987.
11. K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1. EATCS Monographs on Theoretical Computer Science, 1992.
12. D. Gelernter: Generative Communication in Linda. ACM TOPLAS 7(1):80-112, 1985.
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.
14. W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer-Verlag (1985).
15. W. Reisig: Petri Nets and Algebraic Specifications. Theoretical Computer Science 80, 1-34, 1991.
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.
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.
18. D. Scott: Domains for Denotational Semantics. Proc. ICALP, Springer Verlag, 1982.
19. J. Vautherin: Parallel Systems Specification with Colored Petri Nets and Algebraic Specification. LNCS Vol. 266, Springer-Verlag, 1987.