Petrify is a tool for synthesis of Petri nets and asynchronous controllers. Petrify reads a Petri net and generates another bisimilar Petri net which is simpler than the original description. Initially, petrify performs a token flow analysis of the initial Petri net 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 Petri net. Petrify is able to obtain Petri nets with some specific properties: pure, free choice, unique choice, place irredundant, etc. The Petri nets accepted by petrify can also be interpreted as Signal Transition Graphs describing the behavior of asynchronous controllers. Petrify is able to solve the Complete State Coding problem and generate a speed-independent circuit. Petrify also includes another application called draw_astg to draw Signal Transition Graphs in several graphic formats.

References in zbMATH (referenced in 27 articles )

Showing results 1 to 20 of 27.
Sorted by year (citations)

1 2 next

  1. Ahmed, Aishah; Koutny, Maciej; Pietkiewicz-Koutny, Marta: Synthesising elementary net systems with localities (2022)
  2. Abbasi, Rosa; Ghassemi, Fatemeh; Khosravi, Ramtin: Verification of asynchronous systems with an unspecified component (2019)
  3. Best, Eike; Devillers, Raymond; Schlachter, Uli: Bounded choice-free Petri net synthesis: algorithmic issues (2018)
  4. Best, Eike; Devillers, Raymond: The power of prime cycles (2016)
  5. Schlachter, Uli: Petri net synthesis for restricted classes of nets (2016)
  6. Aalst, Wil M. P.van der; Lohmann, Niels; La Rosa, Marcello: Ensuring correctness during process configuration via partner synthesis (2012) ioport
  7. Lohmann, Niels; Wolf, Karsten: Compact representations and efficient algorithms for operating guidelines (2011)
  8. Solé, Marc; Carmona, Josep: \textttrbminer: a tool for discovering Petri nets from transition systems (2010) ioport
  9. van der Aalst, W. M. P.; Rubin, V.; Verbeek, H. M. W.; van Dongen, B. F.; Kindler, E.; Günther, C. W.: Process mining: a two-step approach to balance between underfitting and overfitting (2010) ioport
  10. Khomenko, Victor; Schaefer, Mark; Vogler, Walter; Wollowski, Ralf: STG decomposition strategies in combination with unfolding (2009)
  11. Khomenko, Victor; Madalinski, Agnes; Yakovlev, Alex: Resolution of encoding conflicts by signal insertion and concurrency reduction based on STG unfoldings (2008)
  12. Schaefer, Mark; Vogler, Walter: Component refinement and CSC-solving for STG decomposition (2007)
  13. Frank, Uri; Kapshitz, Tsachy; Ginosar, Ran: A predictive synchronizer for periodic clock domains (2006)
  14. Khomenko, Victor; Koutny, Maciej; Yakovlev, Alex: Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT (2006)
  15. Pastor, Enric; Peña, Marco A.; Solé, Marc: TRANSYT: A tool for the verification of asynchronous concurrent systems (2005)
  16. Schäfer, Mark; Vogler, Walter; Jančar, Petr: Determinate STG decomposition of marked graphs (2005)
  17. Tripakis, Stavros; Yovine, Sergio; Bouajjani, Ahmed: Checking timed Büchi automata emptiness efficiently (2005)
  18. Esparza, Javier: A polynomial-time algorithm for checking consistency of free-choice signal transition graphs (2004)
  19. Khomenko, Victor; Koutny, Maciej; Yakovlev, Alex: Detecting state encoding conflicts in STG unfoldings using SAT (2004)
  20. Beerel, Peter A.; Xie, Aiguo: Performance analysis of asynchronous circuits using Markov chains (2002)

1 2 next