A framework for the verification of infinite-state graph transformation systems
type: Item
instance of: scholarly article
title: A framework for the verification of infinite-state graph transformation systems
zbMATH Open document ID: 1153.68034
author: Paolo Baldan
author: Andrea Corradini
author: Barbara König
published in: Information and Computation
publication date: 2008-08-14T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5312290
zbMATH Keywords: graph transformation
zbMATH Keywords: Petri nets
zbMATH Keywords: category theory
zbMATH Keywords: abstraction
zbMATH Keywords: verification
describes a project that uses: AGG
describes a project that uses: Augur 2
MaRDI profile type: Publication
full work available at URL: j.ic.2008.04.002
OpenAlex ID: W2145270986
cites work: Q4693062
cites work: Q4791846
cites work: CONCUR 2004 - Concurrency Theory
cites work: A Temporal Graph Logic for Verification of Graph Transformation Systems
cites work: Unfolding semantics of graph transformation
cites work: Q4438762
cites work: Q4813402
cites work: Functorial models for Petri nets
cites work: Q2754081
cites work: Q4890710
cites work: Q4530231
cites work: Q4385532
cites work: Formal Methods for Open Object-Based Distributed Systems
cites work: Q4194478
cites work: Q4951112
cites work: Branching processes of Petri nets
cites work: Model checking using net unfoldings
cites work: Graph rewriting for the π-calculus
cites work: Q4502817
cites work: Semantics of inhibitor nets
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Incremental construction of coverability graphs
cites work: Verification of random graph transformation systems
cites work: Computer Aided Verification
cites work: Property preserving abstractions for the verification of concurrent systems
cites work: Q5639839
cites work: Interpolants and Symbolic Model Checking
cites work: Petri nets are monoids
cites work: Q4791828
cites work: Contextual nets
cites work: Q4222939
cites work: Q3219122
cites work: Programming Languages and Systems
cites work: Concurrency, graphs and models. Essays dedicated to Ugo Montanari on the occasion of his 65th birthday
cites work: Abstract graph transformation
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Q4461960
cites work: Efficiency of asynchronous systems and read arcs in petri nets
cites work: Verifying Temporal Heap Properties Specified via Evolution Logic
DOI: 10.1016/J.IC.2008.04.002
Recommended article: Verification of Graph Transformation Systems with Context-Free Specifications
Recommended article: Q4808811
Recommended article: Unfolding Graph Transformation Systems: Theory and Applications to Verification
Recommended article: Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction
Recommended article: Verifying a behavioural logic for graph transformation systems
Recommended article: Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions
Recommended article: k-Inductive Invariant Checking for Graph Transformation Systems
Recommended article: Application of Graph Transformation in Verification of Dynamic Systems
Recommended article: Towards a Systematic Method for Proving Termination of Graph Transformation Systems
description: scientific article; zbMATH DE number 5312290