Expressivity in the κ Family

Laneve, Cosimo; Vitale, A.

doi:10.1016/j.entcs.2008.10.007

Cited by 5 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Actually, our initial motivation for studying the expressive power of synchronizations has been the implementation of biologically inspired languages in pi calculus. In [13], we demonstrated that it is not possible to implement the κ-calculus into one admitting at most two reactants. In that paper, the expressive power was demonstrated by analyzing the models of a biologically relevant reaction (the homeo-trimerization).…”

Section: Introductionmentioning

confidence: 99%

The Expressive Power of Synchronizations

Laneve

Vitale

2010

2010 25th Annual IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

A synchronization is a mechanism allowing two or more processes to perform actions at the same time. We study the expressive power of synchronizations gathering more and more processes simultaneously. We demonstrate the nonexistence of a uniform, fully distributed translation of Milner's CCS with synchronizations of n + 1 processes into CCS with synchronizations of n processes that retains a "reasonable" semantics. We then extend our study to CCS with symmetric synchronizations allowing a process to perform both inputs and outputs at the same time. We demonstrate that synchronizations containing more than three input/output items are encodable in those with three items, while there is an expressivity gap between three and two.

show abstract

Section: Introductionmentioning

confidence: 99%

The Expressive Power of Synchronizations

Laneve

Vitale

2010

2010 25th Annual IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

A Petri net view of covalent bonds

Melgratti

Mezzina

Pinna

2022

Theoretical Computer Science

View full text Add to dashboard Cite

On the Expressive Power of Multiple Heads in CHR

Giusto¹,

Gabbrielli

Meo

2012

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

International audienceConstraint Handling Rules (CHR) is a committed-choice declarative language that has been originally designed for writing constraint solvers and is nowadays a general purpose language. CHR programs consist of multiheaded guarded rules which allow to rewrite constraints into simpler ones until a solved form is reached. Many empirical evidences suggest that multiple heads augment the expressive power of the language, however no formal result in this direction has been proved, so far. In the first part of this article we analyze the Turing completeness of CHR with respect to the underlying constraint theory. We prove that if the constraint theory is powerful enough then restricting to single head rules does not affect the Turing completeness of the language. On the other hand, differently from the case of the multiheaded language, the single head CHR language is not Turing powerful when the underlying signature (for the constraint theory) does not contain function symbols. In the second part we prove that, no matter which constraint theory is considered, under some reasonable assumptions it is not possible to encode the CHR language (with multi-headed rules) into a single headed language while preserving the semantics of the programs. We also show that, under some stronger assumptions, considering an increasing number of atoms in the head of a rule augments the expressive power of the language. These results provide a formal proof for the claim that multiple heads augment the expressive power of the CHR language

show abstract

Expressivity in the κ Family

Cited by 5 publications

References 8 publications

The Expressive Power of Synchronizations

The Expressive Power of Synchronizations

A Petri net view of covalent bonds

On the Expressive Power of Multiple Heads in CHR

Contact Info

Product

Resources

About