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

model checking has been studied as a promising technique for applying various model checking methods to infinite state systems. Graph transformation systems [11], which can model many distributed and concurrent algorithms, are examples of such infinite systems.We have been studying abstraction of several kinds of link structures, which are instances of graph transformation systems. First, we introduced abstraction of heap structures using regular expressions mainly for verifying concurrent garbage collection algorithms [14,15]. In this setting, each cell has a color and a link to another cell. Since cells can be allocated dynamically during execution, it is impossible to enumerate all the execution states of the heap. Thus we need to use abstraction for applying finite verification methods.

Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification