Component refinement and CSC-solving for STG decomposition

DOI10.1016/J.TCS.2007.08.005MaRDI QIDQ2464945zbMATH OpenOpenAlexFDO

Authors Mark Schaefer, Walter Vogler

Publication date 18 December 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.08.005

zbMATH Keywords

decompositionPetri netsasynchronous circuitsimplementation relationSTG

Mathematics Subject Classification ID

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

Recommendations

• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 1954396
• Improved decomposition of signal transition graphs
• Applications and Theory of Petri Nets 2005
• scientific article; zbMATH DE number 5507693

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1955908 (Why is no real title available?)
• scientific article; zbMATH DE number 1979561 (Why is no real title available?)
• scientific article; zbMATH DE number 3273524 (Why is no real title available?)
• Arbiters: An exercise in specifying and decomposing asynchronously communicating components
• Improved decomposition of signal transition graphs
• Logic Synthesis for Asynchronous Controllers and Interfaces
• STG decomposition strategies in combination with unfolding

Cited in

(13)

• STG decomposition strategies in combination with unfolding
• On the complexity of consistency and complete state coding for signal transition graphs
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 1954396 (Why is no real title available?)
• Resolution of encoding conflicts by signal insertion and concurrency reduction based on STG unfoldings
• Projection approaches to process mining using region-based techniques
• Improved decomposition of signal transition graphs
• Avoiding irreducible CSC conflicts by internal communication
• Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesis
• Richer interface automata with optimistic and pessimistic compatibility
• scientific article; zbMATH DE number 2112982 (Why is no real title available?)
• Combining Decomposition and Unfolding for STG Synthesis
• A linear-time branching-time perspective on interface automata

Describes a project that uses

Uses Software

• Petrify

This page was built for publication: Component refinement and CSC-solving for STG decomposition

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