Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Genericity and the π-CalculusPublished by Springer Nature ,2003
- Abstract State MachinesPublished by Springer Nature ,2003
- On the Expressive Power of Polyadic Synchronisation in π-calculusElectronic Notes in Theoretical Computer Science, 2002
- Sequentiality and the π-CalculusPublished by Springer Nature ,2001
- Mobile ambientsTheoretical Computer Science, 2000
- An asynchronous model of locality, failure, and process mobilityPublished by Springer Nature ,1997
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- On reduction-based process semanticsTheoretical Computer Science, 1995
- Timed Process Algebras: A TutorialPublished by Springer Nature ,1993
- On asynchronous communication semanticsPublished by Springer Nature ,1992