Skip to main content
Journal Article

Basic theory of reduction congruence for two timed asynchronous π-calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3170 115-130
DOI: 10.1007/978-3-540-28644-8_8
32Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study reduction congruence, the most widely used notion of equality for the asynchronous π-calculus with timers, and derive several alternative characterisations, one of them being a labelled asynchronous bisimilarity. These results are adapted to an asynchronous π-calculus with timers, locations and message failure. In addition we investigate the problem of how to distribute value-passing processes in a semantics-preserving way. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Berger, M. (2004). Basic theory of reduction congruence for two timed asynchronous π-calculi. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3170, 115–130. https://doi.org/10.1007/978-3-540-28644-8_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free