Tout DSpace

Parcourir par sujet "Petri nets"

Voici les éléments 1-4 de 4

    • Graph-Based STA for Asynchronous Controllers 

      Xiromeritis N., Simoglou S., Sotiriou C., Sketopoulos N. (2019)
      In this work, we present an Asynchronous Static Timing Analysis (ASTA) EDA methodology for cyclic, Asynchronous Control Circuits. Our methodology operates using Graph-based Analysis (GBA) principles, as conventional ...

    • Graph-based STA for asynchronous controllers 

      Simoglou S., Xiromeritis N., Sotiriou C., Sketopoulos N. (2020)
      We present a Graph-based Asynchronous Static Timing Analysis (ASTA) methodology for Asynchronous Control Circuits, which pessimistically computes Critical Cycle(s), instead of Critical Paths, without cycle cutting. Its ...

    • Linear Time S-Component Extraction for General Petri Nets 

      Sakellariou A., Valiantzas D., Sotiriou C., Xiromeritis N., Sketopoulos N. (2019)
      In this work, we present a linear time, S-component extraction algorithm capable of handling strongly connected, General Petri Nets. Most prior works have focused exclusively on Free-Choice or Extended Free-Choice Nets. ...

    • STA for mixed cyclic, acyclic circuits 

      Simoglou S., Sotiriou C., Valiantzas D., Sketopoulos N. (2020)
      In this work, we present a Static Timing Analysis (STA) methodology for cyclic circuits with attached acyclic datapaths, as an alternative to SPICE level electrical simulation, based on ASTA (Asynchronous STA). Our methodology ...