CONCUR 2004 - Concurrency Theory
From MaRDI portal
Publication:5311499
DOI10.1007/b100113zbMath1099.68046OpenAlexW2499482941MaRDI QIDQ5311499
Barbara König, Paolo Baldan, Andrea Corradini
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100113
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (10)
Unfolding semantics of graph transformation ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Explicit State Model Checking for Graph Grammars ⋮ Mind the Shapes: Abstraction Refinement Via Topology Invariants ⋮ Abstracting Complex Data Structures by Hyperedge Replacement ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ McMillan’s Complete Prefix for Contextual Nets ⋮ Application of Graph Transformation in Verification of Dynamic Systems ⋮ Towards automated software model checking using graph transformation systems and bogor ⋮ Formal Verification of Object-Oriented Graph Grammars Specifications
Uses Software
This page was built for publication: CONCUR 2004 - Concurrency Theory
