Petri nets and speed independent design

Misunas, David P.

doi:10.1145/355609.362318

Cited by 40 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…STGS have been used in other architectures to allow multiple-input changes [3,13,17]. The STG, based on Petri Nets [15], assigns input changes to directed arcs. Hazardous input changes are avoided by adding arcs so that inputs remain persistent as the graph is traversed one bit (arc) at a time [13].…”

Section: Discussionmentioning

confidence: 99%

Synthesis of multiple-input change asynchronous finite state machines

Ladd

Birmingham

1991

Proceedings of the 28th Conference on ACM/IEEE Design Automation Conference - DAC '91

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

Synthesis of multiple-input change asynchronous finite state machines

Ladd

Birmingham

1991

Proceedings of the 28th Conference on ACM/IEEE Design Automation Conference - DAC '91

View full text Add to dashboard Cite

“…It was discovered during the MIT MAC project [13][14][15] that Petri Nets, with their capabilities for describing distributed asynchronous computations as collection of asynchronous concurrent behaviors, is a natural way of specifying asynchronous pipelined systems. Such description can then be used for performance analysis, synthesis, validation and other forms of formal reasoning.…”

Section: Use Of Petri Nets For Modeling Elastic Systemsmentioning

confidence: 99%

“…Among all R&R configurations that satisfy constraints (15), the ones with minimal cycle time can be found with the following MILP:…”

Section: Minimal Effective Cycle Timementioning

confidence: 99%

Elasticity and Petri Nets

Cortadella

Kishinevsky

Bufistov

et al. 2008

Transactions on Petri Nets and Other Models of Concurrency I

View full text Add to dashboard Cite

Abstract. Digital electronic systems typically use synchronous clocks and primarily assume fixed duration of their operations to simplify the design process. Time elastic systems can be constructed either by replacing the clock with communication handshakes (asynchronous version) or by augmenting the clock with a synchronous version of a handshake (synchronous version). Time elastic systems can tolerate static and dynamic changes in delays (asynchronous case) or latencies (synchronous case) of operations that can be used for modularity, ease of reuse and better power-delay trade-off. This paper describes methods for the modeling, performance analysis and optimization of elastic systems using Marked Graphs and their extensions capable of describing behavior with early evaluation. The paper uses synchronous elastic systems (aka latency-tolerant systems) for illustrating the use of Petri Nets, however most of the methods can be applied without changes (except changing the delay model associated with events of the system) to asynchronous elastic systems.

show abstract

“…This can be used to produce a user-readable description of the functionality of a circuit in the form of a timing diagram-like labeled Petri Net (a Signal Transition Graph, STG). Another potential application is to optimize the input to direct synthesis methods that have been devised for Petri Nets using both synchronous and asynchronous circuit design techniques ( [39], [8], [44]). Fig.…”

Section: Bottom-up Approach: Analysis Of Concurrent Systemsmentioning

confidence: 99%

Deriving Petri nets from finite transition systems

Cortadella

Kishinevsky

Lavagno

et al. 1998

IEEE Trans. Comput.

197

221

View full text Add to dashboard Cite

This paper presents a novel method to derive a Petri Net from any specification model that can be mapped into a statebased representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for Elementary Transition Systems (ETS). Previous work has shown that, for any ETS, there exists a Petri Net with minimum transition count (one transition for each label) with a reachability graph isomorphic to the original Transition System. Our method extends and implements that theory by using the following three mechanisms that provide a framework for synthesis of safe Petri Nets from arbitrary TSs. First, the requirement of isomorphism is relaxed to bisimulation of TSs, thus extending the class of synthesizable TSs to a new class called Excitation-Closed Transition Systems (ECTS). Second, for the first time, we propose a method of PN synthesis for an arbitrary TS based on mapping a TS event into a set of transition labels in a PN. Third, the notion of irredundant region set is exploited, to minimize the number of places in the net without affecting its behavior. The synthesis method can derive different classes of place-irredundant Petri Nets (e.g., pure, free choice, unique choice) from the same TS, depending on the constraints imposed on the synthesis algorithm. This method has been implemented and applied in different frameworks. The results obtained from the experiments have demonstrated the wide applicability of the method.

show abstract

Petri nets and speed independent design

Cited by 40 publications

References 10 publications

Synthesis of multiple-input change asynchronous finite state machines

Synthesis of multiple-input change asynchronous finite state machines

Elasticity and Petri Nets

Deriving Petri nets from finite transition systems

Contact Info

Product

Resources

About