Abstract
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.
This work has been supported by the HCM Project EXPRESS and by the Esprit Research Project CALIBAN.
Preview
Unable to display preview. Download preview PDF.
References
E. Best and C. Palamidessi: Linear constraint systems as high-level nets. Proc. CONCUR'96. Springer LNCS 1119 (1996) 498–513
A. Brogi and P. Ciancarini: The concurrent language Shared Prolog. ACM TOPLAS 13 (1991) 99–123
F.S. de Boer and C. Palamidessi. Embedding as a Tool for Language Comparison. Information and Computation 108 (1994) 128–157
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–13
N. Carriero and D. Gelernter: Linda in context. Comm. ACM 32 (1989) 445–458
R. Janicki and M. Koutny: Structure of Concurrency. Theoretical Computer Science 112 (1993) 5–52
R. Janicki and M. Koutny: Semantics of Inhibitor Nets. Information and Computation 123 (1995) 1–16
N. Kobayashi and A. Yonezawa: ACL-A Concurrent Linear Logic Programming Paradigm. Proc. of the International Logic Programming Symposium (1993) 279–294
D. Gelernter: Generative Communication in Linda. ACM TOPLAS 7 (1985) 80–112
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–324
U. Montanari and F. Rossi: True concurrency in concurrent constraint programming. Proc. of the International Logic Programming Symposium (1991) 694–716
U. Montanari and F. Rossi: Graph rewriting for a partial order semantics of concurrent constraint programming. Theoretical Computer Science 109 (1993)
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)
U. Montanari and F. Rossi: Contextual nets. Acta Informatica 32 (1995)
W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science 3 (1985)
G.A. Ringwood: Parlog86 and the dining logicians. Comm. ACM 31 (1988) 10–25
F. Rossi: Constraints and Concurrency. PhD thesis, University of Pisa (1993)
V.A. Saraswat: Concurrent Constraint Programming. PhD thesis, Carnegie-Mellon University (1989) Published by The MIT Press (1993)
V.A. Saraswat and P. Lincoln: Higher-order, linear concurrent constraint programming. Technical report, Xerox PARC (1992)
V.A. Saraswat and M. Rinard: Concurrent constraint programming. Proc. of the seventeenth ACM Symposium on Principles of Programming Languages (1990) 232–245
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–353
E. Shapiro: Embedding Linda and other joys of concurrent logic programming. Technical Report, The Weizmann Institute of Science (1989)
P.H. Starke: Processes in Petri Nets. Elektronische Informationsverarbeitung and Kybernetik 17 (1981) 389–416
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E., de Boer, F.S., Palamidessi, C. (1997). Partial order and SOS semantics for linear constraint programs. In: Garlan, D., Le Métayer, D. (eds) Coordination Languages and Models. COORDINATION 1997. Lecture Notes in Computer Science, vol 1282. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63383-9_85
Download citation
DOI: https://doi.org/10.1007/3-540-63383-9_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63383-9
Online ISBN: 978-3-540-69527-1
eBook Packages: Springer Book Archive