A concurrent pattern calculus

Given-Wilson, T; Gorla, D; Jay, B

A concurrent pattern calculus

Given-Wilson, T

Gorla, D Jay, B

Permalink

Publication Type:: Journal Article
Citation:: Logical Methods in Computer Science, 2014, 10 (3)
Issue Date:: 2014-08-22

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published VersionAdobe PDF (475.76 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Given-Wilson, T https://orcid.org/0000-0001-8700-2671	en_US
dc.contributor.author	Gorla, D	en_US
dc.contributor.author	Jay, B https://orcid.org/0000-0001-8654-4305	en_US
dc.date.issued	2014-08-22	en_US
dc.identifier.citation	Logical Methods in Computer Science, 2014, 10 (3)	en_US
dc.identifier.uri	http://hdl.handle.net/10453/30618
dc.description.abstract	Concurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes symmetrical, with information flowing in both directions. CPC provides a natural language to express trade where information exchange is pivotal to interaction. The unification allows some patterns to be more discriminating than others; hence, the behavioural theory must take this aspect into account, so that bisimulation becomes subject to compatibility of patterns. Many popular process calculi can be encoded in CPC; this allows for a gain in expressiveness, formalised through encodings. © T. Given-Wilson, D. Gorla, and B. Jay.	en_US
dc.relation.ispartof	Logical Methods in Computer Science	en_US
dc.relation.isbasedon	10.2168/LMCS-10(3:10)2014	en_US
dc.title	A concurrent pattern calculus	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	10	en_US
utslib.for	0101 Pure Mathematics	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0803 Computer Software	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	open_access
pubs.issue	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	10	en_US

Abstract:

Concurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes symmetrical, with information flowing in both directions. CPC provides a natural language to express trade where information exchange is pivotal to interaction. The unification allows some patterns to be more discriminating than others; hence, the behavioural theory must take this aspect into account, so that bisimulation becomes subject to compatibility of patterns. Many popular process calculi can be encoded in CPC; this allows for a gain in expressiveness, formalised through encodings. © T. Given-Wilson, D. Gorla, and B. Jay.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/30618