Approximating the behaviour of graph transformation systems

DOI10.1007/3-540-45832-8_4MaRDI QIDQ4438762zbMATH OpenFDO

Authors Paolo Baldan, Barbara König

Publication date 10 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2505/25050014.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A framework for the verification of infinite-state graph transformation systems
• scientific article; zbMATH DE number 2090850
• A static analysis technique for graph transformation systems
• Verifying a behavioural logic for graph transformation systems
• CONCUR 2004 - Concurrency Theory

Cited in

(20)

• Towards automated software model checking using graph transformation systems and bogor
• Verification of random graph transformation systems
• Simulation of generalised semi-Markov processes based on graph transformation systems
• Exploiting over- and under-approximations for infinite-state counterpart models
• The Edge of Graph Transformation — Graphs for Behavioural Specification
• Lessons Learned from Building a Graph Transformation System
• Unfolding Graph Transformation Systems: Theory and Applications to Verification
• Explicit State Model Checking for Graph Grammars
• Abstracting Complex Data Structures by Hyperedge Replacement
• Verification of graph grammars using a logical approach
• scientific article; zbMATH DE number 1136656 (Why is no real title available?)
• scientific article; zbMATH DE number 2087494 (Why is no real title available?)
• scientific article; zbMATH DE number 2090850 (Why is no real title available?)
• Verification of graph transformation systems with context-free specifications
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• scientific article; zbMATH DE number 7308467 (Why is no real title available?)
• Strong Joinability Analysis for Graph Transformation Systems in CHR
• Formal verification of graph grammars using mathematical induction
• CONCUR 2004 - Concurrency Theory
• A framework for the verification of infinite-state graph transformation systems

This page was built for publication: Approximating the behaviour of graph transformation systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4438762)