Abstract

Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original description and (2) produces an optimized net-list of an asynchronous controller in the target gate library while preserving the specified input-output behavior. Given a specification petrify provides a designer with a net-list of an asynchronous circuit and a PN-like description of the circuit behavior in terms of events and ordering relations between events. The latter ability of back-annotating to the specification level helps the designer to control the design process. For transforming a specification petrify performs a token flow analysis of the initial PN and produces a transition system (TS). In the initial TS, all transitions with the same label are considered as one event. The TS is then transformed and transitions relabeled to fulfill the conditions required to obtain a safe irredundant PN. For synthesis of an asynchronous implementation petrify performs state assignment by solving the Complete State Coding problem. State assignment is coupled with logic minimization and speed-independent technology mapping to a target library. The final net-list is guaranteed to be speed-independent, i.e., hazard-free under any distribution of gate delays and multiple input changes satisfying the initial specification. The tool has been used for synthesis of PNs and PNs composition [10], synthesis [7, 9, 8] and re-synthesis [29] of asynchronous controllers and can be also applied in areas related with the analysis of concurrent programs. This paper provides an overview of petrify and the theory behind its main functions.

Citations

3118	Communicating sequential processes - Hoare - 1978
2970	Communication and Concurrency - Milner - 1989
1225	A calculus of communicating systems - Milner - 1980
1195	Petri Nets: Properties, Analysis and Applications - Murata - 1989
792	Symbolic boolean manipulation with ordered binary decision diagrams - Bryant - 1992
298	Kommunikation mit Automaten - Petri - 1962
234	Theory for Automatic Hierarchical Verification of SpeedIndependent Circuits, ACM Distinguished Dissertations - Dill - 1989
191	Synthesis of Self-Timed VLSI Circuits From GraphTheoretic Specifications - Chu - 1987
145	Asynchronous Sequential Switching Circuits - Unger - 1969
98	A theory of asynchronous circuits - Muller, Bartky - 1959
96	Verification of sequential machines using Boolean functional vectors - Coudert, Berthet, et al. - 1989
73	Automatic gate-level synthesis of speed independent circuits - Beerel, Meng - 1992
67	Signal graphs: from self-timed to timed ones - Rosenblum, Yakovlev - 1985
66	Presheaves as transition systems - Winskel, Nielsen - 1996
64	Algorithms for Synthesis and Testing of Asynchronous Circuits - Lavagno, Sangiovanni-Vincentelli - 1993
60	Analysis of Discrete Event Coordination - Kurshan - 1989
55	Automatic synthesis of locally-clocked asynchronous state machines - Nowick, Dill - 1991
45	Concurrent hardware: the theory and practice of self-timed design - Kishinevsky, Kondratyev, et al. - 1994
41	Petri nets and step transition systems - Mukund - 1992
40	Basic gate implementation of speedindependent circuits - Kondratyev, Kishinevsky, et al. - 1994
40	A generalized state assignment theory for transformations on signal transition graphs - Vanbekbergen, Lin, et al. - 1994
33	Synthesizing petri nets from state-based models - Cortadella, Kishinevsky, et al. - 1995
33	Bounded delay timing analysis of a class of CSP programs with choice - Hulgaard, Burns - 1994
30	General condition for the decomposition of state holding elements - Burns - 1996
30	Representing and modeling digital circuits - Rokicki - 1993
25	On the models for designing vlsi asynchronous digital systems - Chu - 1986
22	W.: The synthesis problem of Petri nets - Desel, Reisig - 1996
18	Combining process algebras and Petri nets for the specification and synthesis of asynchronous circuits - Pena, Cortadella - 1996
17	Complete state encoding based on the theory of regions - Cortadella, Kishinevsky, et al. - 1996
15	Graph models for reachability analysis of concurrent programs - Pezze, Taylor, et al. - 1992
14	G.: Partial (Set) 2-Structures - Ehrenfeucht, Rozenberg - 1990
11	On the synchronic structure of transition systems - Bernardinello, Michelis, et al.
9	Operating Systems - Tsichritzis, Bernstein - 1974
6	Polynomial algorithms for the synthesis of bounded nets - Darondeau - 1994
6	Methodology and tools for state encoding in asynchronous circuit synthesis - Cortadella, Kishinevsky, et al. - 1996
3	Extended state diagrams and reactive systems - Drusinsky - 1994
2	Coupling technology mapping, logic optimization and state encoding - Cortadella, Kishinevsky, et al. - 1996
2	ConcurrentHardware: The Theory and Practice of Self-Timed Design - Kishinevsky, Kondratyev, et al. - 1993