A Framework for NLC and ESM: Local Action Systems

Verlinden, Nico; Janssens, Dirk

doi:10.1007/978-3-540-46464-8_14

Cited by 4 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This can be dealt with by embedding those alphabets in a free commutative monoid, as we did in Example 1, provided that the productions are such that they do not introduce the new labels (formal sums of the original ones) when applied to a graph that contains only labels from the original alphabet. In fact, the alphabets of Example 1 are the ones used to encode ESM systems in Janssens (1999) and Verlinden and Janssens (2000). Second, most models use an embedding mechanism that either deletes edges or redirects them, but does not change their label.…”

Section: Definition 10mentioning

confidence: 99%

See 1 more Smart Citation

Algebraic properties of processes for Local Action Systems

Verlinden

Janssens

2002

Math. Struct. Comp. Sci.

Self Cite

View full text Add to dashboard Cite

Graph rewriting has been used extensively to model the behaviour of concurrent systems and to provide a formal semantics for them. In this paper, we investigate processes for Local Action Systems (LAS); LAS generalize several types of graph rewriting based on node replacement and embedding. An important difference between processes for Local Action Systems and the process notions that have been introduced for other systems, for example, Petri nets, is the presence of a component describing the embedding mechanism. The aim of the paper is to develop a methodology for dealing with this embedding mechanism: we introduce a suitable representation (a dynamic structure) for it, and then investigate the algebraic properties of this representation. This leads to a simple characterization of the configurations of a process and to a number of equational laws for dynamic structures. We illustrate the use of these laws by providing an equational proof of one of the basic results for LAS processes, namely that the construction yielding the result graph of a process behaves well with respect to the sequential composition of processes.

show abstract

Section: Definition 10mentioning

confidence: 99%

“…The fact that NLC grammars, ESM grammars and Actor grammars may be viewed as LAS is demonstrated in Verlinden and Janssens (2000).…”

Section: Definition 10mentioning

confidence: 99%