Unfolding Graph Transformation Systems: Theory and Applications to Verification

DOI10.1007/978-3-540-68679-8_3zbMath1143.68422OpenAlexW1518708253MaRDI QIDQ3507354

Barbara König, Paolo Baldan, Andrea Corradini

Publication date: 19 June 2008

Published in: Concurrency, Graphs and Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68679-8_3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (2)

Unfolding Symbolic Attributed Graph Grammars ⋮ Open-graphs and monoidal theories

Cites Work

• On the nature of events: another perspective in concurrency
• A taxonomy of fairness and temporal logic problems for Petri nets
• Unfolding semantics of graph transformation
• Petri nets, event structures and domains. I
• Property preserving abstractions for the verification of concurrent systems
• Model checking using net unfoldings
• An improvement of McMillan's unfolding algorithm
• Contextual Petri nets, asymmetric event structures, and processes
• The non-sequential behaviour of Petri nets
• McMillan’s Complete Prefix for Contextual Nets
• Handbook of Graph Grammars and Computing by Graph Transformation
• Foundations of Software Science and Computation Structures
• CONCUR 2004 - Concurrency Theory
• Event Structure Semantics for Nominal Calculi
• Foundations of Software Science and Computation Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unfolding Graph Transformation Systems: Theory and Applications to Verification