Transformations and decompositions of nets
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Arbiters: an exercise in specifying and decomposing asynchronously communicating components
Science of Computer Programming
A technique for synthesizing distributed burst-mode circuits
DAC '96 Proceedings of the 33rd annual Design Automation Conference
On the models for asynchronous circuit behaviour with OR causality
Formal Methods in System Design
Distributed Algorithms
Signal Graphs: From Self-Timed to Timed Ones
International Workshop on Timed Petri Nets
Proceedings of the IFIP WG10.2/WG10.5 Workshops on Synthesis for Control Dominated Circuits
Structural Transformations Giving B-Equivalent PT-Nets
Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets
Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On the models for designing VLSI asynchronous digital systems
Integration, the VLSI Journal
CASCADE: a tool kernel supporting a comprehensive design method for asynchronous controllers
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Proceedings of the 41st annual Design Automation Conference
Component refinement and CSC-solving for STG decomposition
Theoretical Computer Science
Improved Decomposition of Signal Transition Graphs
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Output-Determinacy and Asynchronous Circuit Synthesis
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Analysis of Static Data Flow Structures
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Avoiding Irreducible CSC Conflicts by Internal Communication
Fundamenta Informaticae - Application of Concurrency to System Design
Combining decomposition and unfolding for STG synthesis
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Determinate STG decomposition of marked graphs
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Component refinement and CSC solving for STG decomposition
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Effective contraction of timed STGs for decomposition based timed circuit synthesis
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Avoiding Irreducible CSC Conflicts by Internal Communication
Fundamenta Informaticae - Application of Concurrency to System Design
Output-Determinacy and Asynchronous Circuit Synthesis
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Analysis of Static Data Flow Structures
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Improved Decomposition of Signal Transition Graphs
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
| Hi-index | 0.00 |
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a first step; this leads to a modular implementation, which can support circuit synthesis by possibly avoiding state explosion or allowing the use of library elements.We present a decomposition algorithm and formally prove it correct, where an interesting aspect is the use of a bisimulation with angelic nondeterminism. In contrast to similar approaches in the literature, our algorithm is very generally applicable. We show that transition contraction - the main operation in the algorithm - can be applied with fewer restrictions than known so far. We also prove that deletion of redundant places can be used in the algorithm, which turns out to be very useful in examples.