On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars

DOI10.1007/978-3-642-15928-2_7zbMath1306.68120OpenAlexW1512067769MaRDI QIDQ4931306

Barbara König, Stefan Schwoon, Alessandro Bruni, Andrea Corradini, Paolo Baldan

Publication date: 4 October 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-15928-2_7

Mathematics Subject Classification ID

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

Related Items (3)

Efficient unfolding of contextual Petri nets ⋮ Construction and SAT-Based Verification of Contextual Unfoldings ⋮ Efficient Contextual Unfolding

This page was built for publication: On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars