Partial order and SOS semantics for linear constraint programs
In this paper we consider linear constraint programming (Icp), a non-monotonic extension of concurrent constraint programming (ccp) which allows to remove information. The entailment relation of a linear constraint system, in terms of which linear constraint programs are defined, is based on the main underlying idea of linear logic: hypotheses in a logical derivation represent physical resources which are consumed, once used in the entailment relation.
We give a semantical analysis of this extension of ccp in terms of the causal relations among occurrences of basic actions (i.e. events). Using a partial order based history model, we define truly concurrent operational and partial order semantic models of lcp. They allow us to compare — and classify — various sublanguages of the proposed extension of ccp (including ccp itself) from the point of view of the degree of parallelism they generate. The two main results of the paper are consistency and completeness of the partial order model with respect to the operational semantics, and thus — as we will argue — its adequacy.
Unable to display preview. Download preview PDF.
- 1.E. Best and C. Palamidessi: Linear constraint systems as high-level nets. Proc. CONCUR'96. Springer LNCS 1119 (1996) 498–513Google Scholar
- 4.F.S. de Boer, C. Palamidessi and E. Best: Concurrent Constraint Programming with Information Removal. Proc. First Int. Workshop on Concurrent Constraint Programming, Venice (1995) 1–13Google Scholar
- 8.N. Kobayashi and A. Yonezawa: ACL-A Concurrent Linear Logic Programming Paradigm. Proc. of the International Logic Programming Symposium (1993) 279–294Google Scholar
- 10.A. Mazurkiewicz: Trace Theory. Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II. Springer-Verlag, LNCS 255 (1987) 279–324Google Scholar
- 11.U. Montanari and F. Rossi: True concurrency in concurrent constraint programming. Proc. of the International Logic Programming Symposium (1991) 694–716Google Scholar
- 12.U. Montanari and F. Rossi: Graph rewriting for a partial order semantics of concurrent constraint programming. Theoretical Computer Science 109 (1993)Google Scholar
- 13.U. Montanari and F. Rossi: Concurrent Semantics for Concurrent Constraint Programming via Contextual Nets. V.J. Saraswat and P. Van Hentenryck (eds.) Constraint Programming (1995)Google Scholar
- 14.U. Montanari and F. Rossi: Contextual nets. Acta Informatica 32 (1995)Google Scholar
- 15.W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science 3 (1985)Google Scholar
- 17.F. Rossi: Constraints and Concurrency. PhD thesis, University of Pisa (1993)Google Scholar
- 18.V.A. Saraswat: Concurrent Constraint Programming. PhD thesis, Carnegie-Mellon University (1989) Published by The MIT Press (1993)Google Scholar
- 19.V.A. Saraswat and P. Lincoln: Higher-order, linear concurrent constraint programming. Technical report, Xerox PARC (1992)Google Scholar
- 20.V.A. Saraswat and M. Rinard: Concurrent constraint programming. Proc. of the seventeenth ACM Symposium on Principles of Programming Languages (1990) 232–245Google Scholar
- 21.V.A. Saraswat, M. Rinard, and P. Panangaden: Semantics foundations of concurrent constraint programming. In Proc. of the eighteenth ACM Symposium on Principles of Programming Languages (1991) 333–353Google Scholar
- 22.E. Shapiro: Embedding Linda and other joys of concurrent logic programming. Technical Report, The Weizmann Institute of Science (1989)Google Scholar
- 23.P.H. Starke: Processes in Petri Nets. Elektronische Informationsverarbeitung and Kybernetik 17 (1981) 389–416Google Scholar