Processes for adhesive rewriting systems
Baldan, P, Corradini, A, Heindel, T, König, B and Sobocinski, P (2006) Processes for adhesive rewriting systems. In, Foundations of Software Science and Computation Structures, Vienna, Austria, 25 - 31 Mar 2006. Springer, 202-216.
Download
Full text not available from this repository.
Description/Abstract
Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, including various modelling frameworks for concurrent and distributed systems. Here we begin the development of a truly concurrent semantics for adhesive rewriting systems by defining the fundamental notion of process, well-known from Petri nets and graph grammars. The main result of the paper shows that processes capture the notion of true concurrency---there is a one-to-one correspondence between concurrent derivations, where the sequential order of independent steps is immaterial, and (isomorphism classes of) processes. We see this contribution as a step towards a general theory of true concurrency which specialises to the various concrete constructions found in the literature.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Event Dates: March 25-31, 2006 |
| ISBNs: | 3540330453 |
| Keywords: | adhesive categories, processes |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems |
| Item ID: | 263475 |
| Date Deposited: | 19 Feb 2007 |
| Last Modified: | 20 Aug 2012 04:20 |
| Contributors: | Baldan, P (Author) Corradini, A (Author) Heindel, T (Author) König, B (Author) Sobocinski, P (Author) Aceto, L (Editor) Ingólfsdóttir, A (Editor) |
| Date: | 2006 |
| Additional Information: | Event Dates: March 25-31, 2006 |
| Status: | Published |
| Publisher: | Springer |
| Further Information: | Google Scholar |
| ISI Citation Count: | 7 |
| URI: | http://eprints.soton.ac.uk/id/eprint/263475 |
Actions (login required)
 |
View Item |
