Designing an asynchronous processor using Petri nets

  title={Designing an asynchronous processor using Petri nets},
  author={Alexei L. Semenov and Albert Koelmans and Lee Lloyd and Alexandre Yakovlev},
  journal={IEEE Micro},
Using a simple example, we demonstrate how to design and analyze asynchronous systems from labeled Petri net specifications, later refining, transforming, and translating them for implementations. 

Figures and Tables from this paper

Modelling and Implementation of Petri Nets Using VHDL
This paper demonstrates the use of a standard hardware description language, VHDL, to model and simulate the operation of Petri nets at different levels of abstraction.
Asynchronous system synthesis based on direct mapping using VHDL and Petri nets
A technique is proposed to synthesise system behavioural specifications written in VHDL into speed-independent asynchronous circuits constructed using David cells, which produces superior results compared with other ones.
Analysing superscalar processor architectures with coloured Petri nets
We describe aspects of modelling a generic superscalar processor architecture using coloured Petri nets (CP-nets), for the purpose of analysis of its real-time properties, such as worst case
A Petri net meta-model to develop software components for embedded systems
  • R. J. Machado, J. Fernandes
  • Computer Science
    Proceedings Second International Conference on Application of Concurrency to System Design
  • 2001
A new Petri net meta-model that can be used to specify, the dynamic behaviour of concurrent systems, using object-oriented modelling concepts together with a generalised arc set capable of coping with the complexity of the current embedded systems is presented.
ALPiNe: A Hardware Computing Platform for High-Level Petri Nets
ALPiNe (Asynchronous High-L evel Petri Net) processor is aimed at embedded discrete-event control applications and is characterized by its natural incorporation of external stimuli into the computation flow.
Modelling of Superscalar Processor Architectures with Design/CPN
We describe aspects of modelling a generic superscalar processor architecture using Coloured Petri nets, for the purpose of analysis of its real-time properties, such as Worst Case Execution Time for
Petri Nets and Digital Hardware Design
An overview of the methods for specification, verification and synthesis of asynchronous circuits with the aid of Petri nets is presented, and a number of design examples are presented to illustrate the authors' belief that Petrinets could become widely accepted by digital system designers as a design method.
Time Petri Net Unfoldings and Hardware Veriication
A novel approach to timing analysis and veriication of asynchronous circuits with bounded delays is described, based on the time-driven unfolding of a time Petri net model of a circuit.
Asynchronous queue machines with explicit forwarding
The interaction between asynchrony and forwarding is analysed, constraints on the usage of forwarding for various models of operation are derived, and consequences for compilers targeting such processors are studied.


Modular, asynchronous control structures for a high performance processor
The example shows that Petri nets, and asynchronous circuits assembled from the few module types introduced below, are suitable for expressing all control functions found in high performance computer systems.
Petri Net Analysis Using Boolean Manipulation
Examples are presented that show how all the reachable states of a Petri net can be efficiently calculated and represented with a small BDD, and properties requiring an exhaustive analysis of the state space can be verified in polynomial time in the size of the BDD.
Petri nets: Properties, analysis and applications
The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Practical verification and synthesis of low latency asynchronous systems
A software prototype CAD tool called Analyze was written as part of this dissertation to allow the principles of this work to be tested and applied and to verify when a specification obeys all the burst-mode rules and can be automatically synthesized into an implementation.
Symbolic Model Checking
Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
Synthesis of self-timed VLSI circuits from graph-theoretic specifications
This thesis presents an approach for direct and efficient synthesis of self-timed (asynchronous) control circuits from formal specifications called Signal Transition Graphs (STGs), and develops a number of analytical results which establish the equivalence between the static structure of nets and their underlying firing sequence semantics.
The Design and Implementation of an Asynchronous Microprocessor
This thesis introduces the Micropipeline approach and discusses the design, organization, implementation and performance of the asynchronous ARM microprocessor which was constructed in the course of the OMI-MAP project.
Stubborn sets for reduced state space generation
  • A. Valmari
  • Computer Science
    Applications and Theory of Petri Nets
  • 1989
The “stubborn set” theory and method for generating reduced state spaces and a more advanced version suited to the analysis of properties of reactive systems is developed.
TITAC: design of a quasi-delay-insensitive microprocessor
TITAC is an asynchronous version of an 8-bit von Neumann microprocessor based on the delay-insensitive model incorporating the isochronic-forks assumption for efficient signal generation and data transfer.