STG decomposition strategies in combination with unfolding

DOI10.1007/s00236-009-0102-yzbMath1183.68125OpenAlexW2021539852MaRDI QIDQ1031867

Ralf Wollowski, Mark Schaefer, Victor Khomenko, Walter Vogler

Publication date: 23 October 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-009-0102-y

zbMATH Keywords

asynchronous circuitsPetri net unfoldings

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computer system organization (68M99)

Related Items (3)

Component refinement and CSC-solving for STG decomposition ⋮ STG decomposition strategies in combination with unfolding ⋮ Modal algebra and Petri nets

Uses Software

• Petrify

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• STG decomposition strategies in combination with unfolding
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Avoiding Irreducible CSC Conflicts by Internal Communication
• Combining Decomposition and Unfolding for STG Synthesis
• Graph-Based Algorithms for Boolean Function Manipulation
• Handshake Circuits
• Balsa: An Asynchronous Hardware Synthesis Language
• Logic Synthesis for Asynchronous Controllers and Interfaces
• Foundations of Software Science and Computational Structures
• Applications and Theory of Petri Nets 2005

This page was built for publication: STG decomposition strategies in combination with unfolding