Determinate STG decomposition of marked graphs

DOI10.1007/11494744_21MaRDI QIDQ5713512zbMATH OpenOpenAlexFDO

Authors Mark Schaefer, Walter Vogler, Petr Jančar

Publication date 14 December 2005

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

Full work available at URL https://doi.org/10.1007/b136988

Mathematics Subject Classification ID

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

Recommendations

• Decomposition in asynchronous circuit design
• Improved decomposition of signal transition graphs
• Component refinement and CSC solving for STG decomposition
• Decomposition in asynchronous circuit design
• On the complexity of consistency and complete state coding for signal transition graphs

Cited in

(7)

• STG decomposition strategies in combination with unfolding
• State space axioms for T-systems
• Component refinement and CSC-solving for STG decomposition
• Stanton graph decompositions
• On the complexity of consistency and complete state coding for signal transition graphs
• Decomposition of Asynchronous Sequential Switching Circuits
• Component refinement and CSC solving for STG decomposition

Describes a project that uses

Uses Software

• Petrify

This page was built for publication: Determinate STG decomposition of marked graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713512)