[go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1908.08633v1 (cs)
[Submitted on 23 Aug 2019]

Title:Comparing Process Calculi Using Encodings

Authors:Kirstin Peters (TU Berlin/TU Darmstadt)
View PDF
Abstract:Encodings or the proof of their absence are the main way to compare process calculi. To analyse the quality of encodings and to rule out trivial or meaningless encodings, they are augmented with encodability criteria. There exists a bunch of different criteria and different variants of criteria in order to reason in different settings. This leads to incomparable results. Moreover, it is not always clear whether the criteria used to obtain a result in a particular setting do indeed fit to this setting. This paper provides a short survey on often used encodability criteria, general frameworks that try to provide a unified notion of the quality of an encoding, and methods to analyse and compare encodability criteria.
Comments: In Proceedings EXPRESS/SOS 2019, arXiv:1908.08213
Subjects: Logic in Computer Science (cs.LO)
ACM classes: F.3.2
Cite as: arXiv:1908.08633 [cs.LO]
  (or arXiv:1908.08633v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1908.08633
Journal reference: EPTCS 300, 2019, pp. 19-38
Related DOI: https://doi.org/10.4204/EPTCS.300.2

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 23 Aug 2019 01:54:49 UTC (31 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2019-08
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

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

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

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?)