TY - GEN
T1 - Partial order and sos semantics for linear constraint programs
AU - Best, Eike
AU - De Boer, Frank S.
AU - Palamidessi, Catuscia
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.
PY - 1997/1/1
Y1 - 1997/1/1
N2 - In this paper we consider linear constraint programming (lcp), a non-monotonie 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.
AB - In this paper we consider linear constraint programming (lcp), a non-monotonie 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.
U2 - 10.1007/3-540-63383-9_85
DO - 10.1007/3-540-63383-9_85
M3 - Conference contribution
AN - SCOPUS:84957049370
SN - 3540633839
SN - 9783540633839
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 256
EP - 273
BT - Coordination Languages and Models - 2nd International Conference COORDINATION 1997, Proceedings
A2 - Garlan, David
A2 - Métayer, Daniel Le
PB - Springer Verlag
T2 - 2nd International Conference on Coordination Models and Languages, COORDINATION 1997
Y2 - 1 September 1997 through 3 September 1997
ER -