A framework for the verification of infinite-state graph transformation systems
From MaRDI portal
Publication:937301
DOI10.1016/j.ic.2008.04.002zbMath1153.68034OpenAlexW2145270986MaRDI QIDQ937301
Andrea Corradini, Barbara König, Paolo Baldan
Publication date: 14 August 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.04.002
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items
Theorem proving graph grammars with attributes and negative application conditions ⋮ Unfolding Grammars in Adhesive Categories ⋮ An Institution for Graph Transformation ⋮ Interactive and automated proofs for graph transformations ⋮ Reachability in Graph Transformation Systems and Slice Languages ⋮ Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic ⋮ Correct transformation: from object-based graph grammars to PROMELA ⋮ Verification of graph grammars using a logical approach ⋮ Unnamed Item ⋮ Processes and unfoldings: concurrent computations in adhesive categories ⋮ The Edge of Graph Transformation — Graphs for Behavioural Specification ⋮ On GS-Monoidal Theories for Graphs with Nesting ⋮ Sound and Complete Abstract Graph Transformation ⋮ Monadic second-order incorrectness logic for GP 2 ⋮ Incorrectness logic for graph programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unfolding semantics of graph transformation
- Petri nets are monoids
- Concurrency, graphs and models. Essays dedicated to Ugo Montanari on the occasion of his 65th birthday
- Branching processes of Petri nets
- Property preserving abstractions for the verification of concurrent systems
- Model checking using net unfoldings
- Functorial models for Petri nets
- Contextual nets
- Incremental construction of coverability graphs
- Semantics of inhibitor nets
- Verification of Random Graph Transformation Systems
- Verifying Temporal Heap Properties Specified via Evolution Logic
- A Temporal Graph Logic for Verification of Graph Transformation Systems
- Handbook of Graph Grammars and Computing by Graph Transformation
- Efficiency of asynchronous systems and read arcs in petri nets
- Graph rewriting for the π-calculus
- Programming Languages and Systems
- CONCUR 2004 - Concurrency Theory
- Interpolants and Symbolic Model Checking
- Computer Aided Verification
- Tools and Algorithms for the Construction and Analysis of Systems
- Formal Methods for Open Object-Based Distributed Systems
This page was built for publication: A framework for the verification of infinite-state graph transformation systems
