Movatterモバイル変換


[0]ホーム

URL:


Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation,member institutions, and all contributors.Donate
arxiv logo>cs> arXiv:1011.6430v1
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1011.6430v1 (cs)
[Submitted on 30 Nov 2010]

Title:A criterion for separating process calculi

Authors:Federico Banti (Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze),Rosario Pugliese (Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze),Francesco Tiezzi (Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze)
View PDF
Abstract:We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any visible action by an arbitrary process never inhibits the capability of the resulting process to perform a visible action. We prove that there exists no compositional and interaction sensitive encoding of a not strongly replacement free calculus into any strongly replacement free one. We then define a weaker version of replacement freeness, by only considering replacement of closed processes, and prove that, if we additionally require the encoding to preserve name independence, it is not even possible to encode a non replacement free calculus into a weakly replacement free one. As a consequence of our encodability results, we get that many calculi equipped with priority are not replacement free and hence are not encodable into mainstream calculi like CCS and pi-calculus, that instead are strongly replacement free. We also prove that variants of pi-calculus with match among names, pattern matching or polyadic synchronization are only weakly replacement free, hence they are separated both from process calculi with priority and from mainstream calculi.
Comments:In Proceedings EXPRESS'10,arXiv:1011.6012
Subjects:Logic in Computer Science (cs.LO); Formal Languages and Automata Theory (cs.FL)
ACM classes:F.1.1; F3.2; F.4.3
Cite as:arXiv:1011.6430 [cs.LO]
 (orarXiv:1011.6430v1 [cs.LO] for this version)
 https://doi.org/10.48550/arXiv.1011.6430
arXiv-issued DOI via DataCite
Journal reference:EPTCS 41, 2010, pp. 16-30
Related DOI:https://doi.org/10.4204/EPTCS.41.2
DOI(s) linking to related resources

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 30 Nov 2010 01:37:39 UTC (74 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
Current browse context:
cs.LO
Change to browse by:
export BibTeX citation

Bookmark

BibSonomy logoReddit logo

Bibliographic and Citation Tools

Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
scite Smart Citations(What are Smart Citations?)

Code, Data and Media Associated with this Article

CatalyzeX Code Finder for Papers(What is CatalyzeX?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)

Demos

Hugging Face Spaces(What is Spaces?)

Recommenders and Search Tools

Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.

Which authors of this paper are endorsers? |Disable MathJax (What is MathJax?)

[8]ページ先頭

©2009-2025 Movatter.jp