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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Baldan, P., Corradini, A., Heindel, T., König, B., & Sobociński, P. (2006). Processes for adhesive rewriting systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3921 LNCS, pp. 202–216). https://doi.org/10.1007/11690634_14
Mendeley helps you to discover research relevant for your work.