Combining Decomposition and Unfolding for STG Synthesis

DOI10.1007/978-3-540-73094-1_15zbMATH Open1226.68058OpenAlexW87105067MaRDI QIDQ3612935FDOQ3612935

Authors: Victor Khomenko, Mark Schaefer 

Publication date: 11 March 2009

Published in: Petri Nets and Other Models of Concurrency – ICATPN 2007 (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/464

Recommendations

• STG decomposition strategies in combination with unfolding
• scientific article; zbMATH DE number 5042671
• scientific article; zbMATH DE number 1954396
• Foundations of Software Science and Computational Structures
• Component refinement and CSC-solving for STG decomposition

zbMATH Keywords

decompositionunfoldingPetri netasynchronous circuitstate space explosionSTG

Mathematics Subject Classification ID

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

Cited In (4)

• Resolution of encoding conflicts by signal insertion and concurrency reduction based on STG unfoldings
• STG decomposition strategies in combination with unfolding
• Avoiding irreducible CSC conflicts by internal communication
• Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesis

This page was built for publication: Combining Decomposition and Unfolding for STG Synthesis

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