English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Graph transformation systems (GTS) have been successfully proposed as ageneral, theoretically sound model for concurrency. Petri nets (PN), on theother side, are a central and intuitive formalism for concurrent or distributedsystems, well supported by a number of analysis techniques/tools. Some PNclasses have been shown to be instances of GTS. In this paper, we changeperspective presenting an operational semantics of GTS in terms of SymmetricNets, a well-known class of Coloured Petri nets featuring a structured syntaxthat outlines model symmetries. Some practical exploitations of the proposedoperational semantics are discussed. In particular, a recently developedstructural calculus for SN is used to validate graph rewriting rules in asymbolic way.

An Operational Semantics of Graph Transformation Systems Using Symmetric Nets