Filters








885 Hits in 5.2 sec

Comparing Process Calculi Using Encodings

Kirstin Peters
2019 Electronic Proceedings in Theoretical Computer Science  
Encodings or the proof of their absence are the main way to compare process calculi.  ...  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  ...  Encodability Criteria Encodings are used to compare process calculi and to reason about their expressive power. Encodability criteria are conditions that limit the existence of encodings.  ... 
doi:10.4204/eptcs.300.2 fatcat:sydba4xpuff7hdkegjftx3ff5e

Analysing and Comparing Encodability Criteria

Kirstin Peters, Rob van Glabbeek
2015 Electronic Proceedings in Theoretical Computer Science  
Encodings or the proof of their absence are the main way to compare process calculi.  ...  This way we reduce the problem of analysing or comparing encodability criteria to the better understood problem of comparing relations on processes.  ...  Introduction Encodings are used to compare process calculi and to reason about their expressive power. Encodability criteria are conditions that limit the existence of encodings.  ... 
doi:10.4204/eptcs.190.4 fatcat:qtqir242zva73h363kajbkvsyi

A criterion for separating process calculi

Federico Banti, Rosario Pugliese, Francesco Tiezzi
2010 Electronic Proceedings in Theoretical Computer Science  
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  ...  priority and from mainstream calculi.  ...  We thank Daniele Gorla and the anonymous reviewers for their fruitful comments that have helped us in improving the paper.  ... 
doi:10.4204/eptcs.41.2 fatcat:f2fifmdomrhwnbl7vanrnedcca

On Distributability in Process Calculi [chapter]

Kirstin Peters, Uwe Nestmann, Ursula Goltz
2013 Lecture Notes in Computer Science  
We present a novel approach to compare process calculi and their synchronisation mechanisms by using synchronisation patterns and explicitly considering the degree of distributability.  ...  For this, we propose a new quality criterion that (1) measures the preservation of distributability and (2) allows us to derive two synchronisation patterns that separate several variants of pi-like calculi  ...  To analyse the quality of encodings and to rule out trivial or meaningless encodings, they are augmented with a set of quality criteria.  ... 
doi:10.1007/978-3-642-37036-6_18 fatcat:hdzudrm3vbfbhm4zh3pdzpknpu

On the Distributability of Mobile Ambients

Kirstin Peters, Uwe Nestmann
2018 Electronic Proceedings in Theoretical Computer Science  
For this reason, we can show that there is no good and distributability-preserving encoding from the standard pi-calculus into mobile ambients and also no such encoding from mobile ambients into the join-calculus  ...  To analyse the quality of mobile ambients as a good foundational model for distributed computation, we analyse the level of synchronisation between distributed components that they can express.  ...  To analyse the degree of distribution in process calculi and to compare different calculi by their power to express synchronisation, [22, 20] defines a criterion for the preservation of distributability  ... 
doi:10.4204/eptcs.276.9 fatcat:u4x7uvwxwjbw5n6msivr6t6dge

A Core Calculus for a Comparative Analysis of Bio-inspired Calculi [chapter]

Cristian Versari
2007 Lecture Notes in Computer Science  
Here we show π@ at work by providing "reasonable" encodings of the two most popular calculi for modeling membrane interactions, namely, BioAmbients and Brane Calculi.  ...  The application of process calculi theory to the modeling and the analysis of biological phenomena has recently attracted the interests of the scientific community.  ...  Conclusions and future work We presented a new calculus, π@, designed to be a core language for analysing formalisms which model localisation and compartmentalisation.  ... 
doi:10.1007/978-3-540-71316-6_28 fatcat:zcq5vkl3lvegpaa5lnjldkmvmm

Full abstraction for expressiveness: history, myths and facts

DANIELE GORLA, UWE NESTMANN
2014 Mathematical Structures in Computer Science  
In some cases, we work at a very abstract level; in other cases, we give concrete samples taken from the field of process calculi, where the theory of expressiveness has been mostly developed in the last  ...  Several examples and counterexamples are given.  ...  We further thank Kirstin Peters for stimulating discussions and proof-reading, and Catuscia Palamidessi for the long-term exchange on the subject and for encouraging us to actually write down our position  ... 
doi:10.1017/s0960129514000279 fatcat:h44cen4sevcclfz23v4kpkiyse

Tutorial on separation results in process calculi via leader election problems

Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi
2007 Theoretical Computer Science  
We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes.  ...  We provide a unified approach for all these calculi using reduction semantics.  ...  We thank the anonymous referees for their very useful and detailed comments.  ... 
doi:10.1016/j.tcs.2007.09.001 fatcat:uq7ppx5q3rezllkql7yqngbcjq

On the Distributability of Mobile Ambients (Technical Report) [article]

Kirstin Peters, Uwe Nestmann
2018 arXiv   pre-print
For this reason, we can show that there is no good and distributability-preserving encoding from the standard pi-calculus into mobile ambients and also no such encoding from mobile ambients into the join-calculus  ...  To analyse the quality of mobile ambients as a good foundational model for distributed computation, we analyse the level of synchronisation between distributed components that they can express.  ...  To analyse the degree of distribution in process calculi and to compare different calculi by their power to express synchronisation, [22, 20] defines a criterion for the preservation of distributability  ... 
arXiv:1808.01599v1 fatcat:ulomlfpp3jgvhf5f7lwpmum76i

On the Expressiveness of Mixed Choice Sessions

Kirstin Peters, Nobuko Yoshida
2022 Electronic Proceedings in Theoretical Computer Science  
Session types provide a flexible programming style for structuring interaction, and are used to guarantee a safe and consistent composition of distributed processes.  ...  We then close their open problem on the encoding from CMV+ into CMV (without mixed choice), proving its soundness and thereby that the encoding is good up to coupled similarity.  ...  The work is partially supported by EPSRC (EP/T006544/1, EP/K011715/1, EP/K034413/1, EP/L00058X/1, EP/N027833/1, EP/N028201/1, EP/T006544/1, EP/T014709/1, EP/V000462/1 and EP/X015955/1) and NCSS/EPSRC VeTSS  ... 
doi:10.4204/eptcs.368.7 fatcat:dc7pc5phszbfvbr3osi7sdfehu

Matching in the Pi-Calculus

Kirstin Peters, Tsvetelina Yonova-Karbe, Uwe Nestmann
2014 Electronic Proceedings in Theoretical Computer Science  
Later on, Gorla developed a by now widely-tested set of criteria for encodings that allows much more freedom (e.g. instead of direct translations of observables it allows comparison of calculi with respect  ...  Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables).  ...  The first quality criterion to compare process calculi presented in Section 3 is compositionality. It induces the definition of a π × = -context parametrised on a set of names for each operator of π.  ... 
doi:10.4204/eptcs.160.3 fatcat:myxiu7vqknhwrardm7oqm5gxre

Matching in the Pi-Calculus (Technical Report) [article]

Kirstin Peters, Tsvetelina Yonova-Karbe, Uwe Nestmann
2014 arXiv   pre-print
Later on, Gorla developed a by now widely-tested set of criteria for encodings that allows much more freedom (e.g. instead of direct translations of observables it allows comparison of calculi with respect  ...  Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables).  ...  To analyse the quality of encodings and to rule out trivial or meaningless encodings, they are evaluated w.r.t. a set of quality criteria.  ... 
arXiv:1407.6406v1 fatcat:v4ia3sodqnhqre6ktlkiif7c7a

Symmetric electoral systems for ambient calculi

Iain Phillips, Maria Grazia Vigliotti
2008 Information and Computation  
This paper compares the expressiveness of different fragments of ambient calculi via leader election problems.  ...  We consider Mobile Ambients (MA), Safe Ambients (SA) and the Push and Pull Ambient Calculus (PAC). Cardelli and Gordon encoded the asynchronous -calculus into MA.  ...  Acknowledgments We thank the following people for useful discussions: Andy Gordon, Kohei Honda, Sergio Maffeis, Catuscia Palamidessi, Nobuko Yoshida and Steffen van Bakel.  ... 
doi:10.1016/j.ic.2007.08.005 fatcat:vm7eqyrytvgipkzgf4l2epykjy

Breaking symmetries

KIRSTIN PETERS, UWE NESTMANN
2014 Mathematical Structures in Computer Science  
and receivers for the same channel) when running two copies in parallel.  ...  Gorla rephrased their results by stating that there is no uniform and reasonable encoding from πmixinto πsep.  ...  properties of this example are preserved by the criteria required for 'good' encodings (compare to Section 3.3).  ... 
doi:10.1017/s0960129514000346 fatcat:briwx4z6lzbtpftqjluf34ulhi

Synchrony vs Causality in the Asynchronous Pi-Calculus

Kirstin Peters, Jens-Wolfhard Schicke, Uwe Nestmann
2011 Electronic Proceedings in Theoretical Computer Science  
We study the relation between process calculi that differ in their either synchronous or asynchronous interaction mechanism.  ...  We assume a number of minimal conditions referring to the work of Gorla: a "good" encoding must be compositional and preserve and reflect computations, deadlocks, divergence, and success.  ...  Causality Analysing the five criteria of the last section, we observe that there are two structural criteria to ensure that a good encoding is implementable, i.e., is of practical interest, and there are  ... 
doi:10.4204/eptcs.64.7 fatcat:lzxtw7vblffkdplbtxbkfho3mu
« Previous Showing results 1 — 15 out of 885 results