Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesis

DOI10.1007/11901914_19zbMATH Open1161.68633OpenAlexW1503060277MaRDI QIDQ3522912FDOQ3522912

Authors: Tomohiro Yoneda, Chris J. Myers 

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

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

Recommendations

• Component refinement and CSC-solving for STG decomposition
• Foundations of Software Science and Computational Structures
• Combining Decomposition and Unfolding for STG Synthesis
• Improved decomposition of signal transition graphs
• Formal Modeling and Analysis of Timed Systems

Mathematics Subject Classification ID

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

Cited In (1)

• TST - an algorithm for global microcode compaction with timing constraints

This page was built for publication: Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesis

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