Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ENTCS
2008

favoriteEmaildiscussreport

74views more ENTCS 2008»

Matching Systems for Concurrent Calculi

13 years 4 months ago

Matching Systems for Concurrent Calculi

Download www.doc.ic.ac.uk

Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients. We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic synchronisation of all finite levels.

Bjørn Haagensen, Sergio Maffeis, Iain Phill

Real-time Traffic

ENTCS 2008 | Mobile Ambients | Pi-calculus | Polyadic Synchronisation |

claim paper

Related Content

» Concurrent Pattern Calculus

» Basic Pattern Matching Calculi a Fresh View on Matching Failure

» Termination in HigherOrder Concurrent Calculi

» Modelling Calculi with Name Mobility using Graphs with Equivalences

» Multi Labelled Transition Systems A Semantic Framework for Nominal Calculi

» Encoding Distributed Process Calculi into LMNtal

» A Stochastic Concurrent Constraint Based Framework to Model and Verify Biological Systems

» A Concurrent Model for Linear Logic

» Electoral Systems in Ambient Calculi

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENTCS
Authors	Bjørn Haagensen, Sergio Maffeis, Iain Phillips

Comments (0)