Filters








1,770 Hits in 5.3 sec

State encoding of large asynchronous controllers

Josep Carmona, Jordi Cortadella
2006 Proceedings of the 43rd annual conference on Design automation - DAC '06  
It is based on the structural theory of Petri nets and can be applied to large specifications with hundreds of signals.  ...  The experimental results validate the quality of the encoded circuits and show the significant improvements that can be obtained by the synthesis of large controllers.  ...  In [3] , a back-end to incorporate logic synthesis into the Balsa system was presented.  ... 
doi:10.1145/1146909.1147148 dblp:conf/dac/CarmonaC06 fatcat:qd4ndfmomfewlbgxspxatpxpxy

State encoding of large asynchronous controllers

J. Carmona, J. Cortadella
2006 Proceedings - Design Automation Conference  
It is based on the structural theory of Petri nets and can be applied to large specifications with hundreds of signals.  ...  The experimental results validate the quality of the encoded circuits and show the significant improvements that can be obtained by the synthesis of large controllers.  ...  In [3] , a back-end to incorporate logic synthesis into the Balsa system was presented.  ... 
doi:10.1109/dac.2006.229414 fatcat:hhgdo3cl2zgdtgfbkagxajd7f4

Synthesis of Reduced Asymmetric Choice Petri Nets [article]

Harro Wimmel
2019 arXiv   pre-print
The aim of Petri net synthesis is to find an unlabelled Petri net in some target class with a reachability graph isomorphic to a given finite labelled transition system (lts).  ...  A Petri net is choice-free if any place has at most one transition in its postset (consuming its tokens) and it is (extended) free-choice (EFC) if the postsets of any two places are either equal or disjoint  ...  The well-known (extended) free-choice nets (EFC) [4] are the subclass of equal-conflict nets where arc weights are limited to one (i.e. plain equal-conflict nets).  ... 
arXiv:1911.09133v2 fatcat:hsf5irfs3ngmxornpebf2evpby

A New Property of Choice-Free Petri Net Systems [chapter]

Eike Best, Raymond Devillers, Evgeny Erofeev
2020 Lecture Notes in Computer Science  
When a Petri net system of some class is synthesised from a labelled transition system, it may be interesting to derive structural properties of the corresponding reachability graphs and to use them in  ...  This was exploited for the synthesis of choicefree nets for instance, for which several interesting properties have been derived.  ...  Fig. 3 . 3 On the left: a cluster in an equal conflict net, with two places and three transitions.  ... 
doi:10.1007/978-3-030-51831-8_5 fatcat:ez53risa4ffbzixkzdqbhzv3pi

An Improved Quasi-Static Scheduling Algorithm for Mixed Data-Control Embedded Software

Liu ., Chun-Chen .
2006 Journal of Applied Sciences  
Petri net (PN) is used the underlying model of computation (MoC) to do formal analysis and verification.  ...  An embedded system is defined as a set of concurrent processes that communicate through channels.  ...  Acknowledgement Dr Yosinori Watanabe proposed some ideas of this project and provided the QSS-1.2 source code. We would like to thank Drs Yosinori Watanabe and Alex Kondratyev for their great help.  ... 
doi:10.3923/jas.2006.1571.1575 fatcat:oheiwfpntrfypn53mosr3y3btq

Digital systems synthesis from Petri net descriptions

Norian Marranghello
1998 DAIMI Report Series  
With such a growing importance in mind, this report aims at presenting an overview of the research going on the application of Petri nets to the description of digital systems and the synthesis of the  ...  Many computer aided design tools dealing with Petri nets for the analyzis, verification and synthesis of this sort of hardware have been recently developed as well.  ...  Next, a labeled Petri net is defined as a Petri net in which every transition is labeled with a symbol from an alphabet A, originating the corresponding labeling function L : T ® A.  ... 
doi:10.7146/dpb.v27i530.7059 fatcat:dozzfyrowfekbcftgxoxykpulu

Application of Petri net theory for modelling and validation of the sucrose breakdown pathway in the potato tuber

I. Koch, B. H. Junker, M. Heiner
2004 Bioinformatics  
The results characterize the net structure and give insights into the complex net behaviour.  ...  We start with hierarchical modelling of the metabolic network as a Petri net and continue with the analysis of qualitative properties of the network.  ...  This work is partly supported by the Federal German Ministry of Education and Research (BMBF), BCB project 0312705D.  ... 
doi:10.1093/bioinformatics/bti145 pmid:15546934 fatcat:opgopbvxpvhirfksiopa3rsgwa

A formal software synthesis approach for embedded hard real-time systems

Raimundo Barreto, Mar�lia Neves, Meuse Oliveira, Paulo Maciel, Eduardo Tavares, Ricardo Lima
2004 Proceedings of the 17th symposium on Integrated circuits and system design - SBCCI '04  
We present a formal approach for automatic embedded hard real-time software synthesis based on time Petri nets.  ...  Software synthesis is defined as the task of translating a specification into a software program, in a general purpose language, in such a way that this software can be compiled by conventional compilers  ...  After obtaining a feasible schedule, C code is generated by traversing a set of conflict-free Petri nets.  ... 
doi:10.1145/1016568.1016615 dblp:conf/sbcci/BarretoNOMTL04 fatcat:n3petq2hkrbs5p6kmtqt27qari

Assessing State Spaces Using Petri-Net Synthesis and Attribute-Based Visualization [chapter]

H. M. W. Verbeek, A. Johannes Pretorius, Wil M. P. van der Aalst, Jarke J. van Wijk
2008 Lecture Notes in Computer Science  
In this paper, we tackle this problem by combining Petri-net synthesis (i.e., regions theory) and visualization.  ...  Using Petri-net synthesis we generate the attributes needed for attribute-based visualization. Using visualization we can assess the state space.  ...  Using regions it is possible to synthesize a finite transition system (i.e., a state space) into a Petri net.  ... 
doi:10.1007/978-3-540-89287-8_10 fatcat:wcpwioggprft7cqpbofjx3rxjy

Synthesis of Asynchronous Hardware from Petri Nets [chapter]

Josep Carmona, Jordi Cortadella, Victor Khomenko, Alex Yakovlev
2004 Lecture Notes in Computer Science  
This paper focuses on some of recent developments and new opportunities for Petri nets in designing asynchronous circuits such as synthesis of asynchronous control circuits from large Petri nets generated  ...  They include direct mapping of Petri nets to circuits, structural methods with linear programming, and synthesis from unfolding prefixes using SAT solvers.  ...  control logic specified by a labelled Petri net.  ... 
doi:10.1007/978-3-540-27755-2_9 fatcat:z4dgiwj54be5bacubhptl3uggq

Unfolding-Based Process Discovery [chapter]

Hernán Ponce-de-León, César Rodríguez, Josep Carmona, Keijo Heljanko, Stefan Haar
2015 Lecture Notes in Computer Science  
Remarkably, the derived Petri net cannot execute any trace from the negative collection. The entire chain of transformations is fully automated.  ...  After deriving an intermediate net unfolding from them, we perform a controlled folding giving rise to a Petri net which contains both the input log and all independence-equivalent traces arising from  ...  A Petri net (PN) is a net together with an initial marking and a total function that labels its transitions over an alphabet A of observable actions.  ... 
doi:10.1007/978-3-319-24953-7_4 fatcat:yvoscarhvbgg3ndpvckesa67rq

Deriving Petri nets from finite transition systems

J. Cortadella, M. Kishinevsky, L. Lavagno, A. Yakovlev
1998 IEEE transactions on computers  
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  ...  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.  ...  The theory in this paper has been implemented in petrify, a tool for the synthesis of Petri Nets and asynchronous circuits (available at http://www.lsi.upc.es/~jordic/petrify).  ... 
doi:10.1109/12.707587 fatcat:cini6yxfufbfbiweqna5j6mmwy

Unfolding-Based Process Discovery [article]

Hernán Ponce-de-León, César Rodríguez, Josep Carmona, Keijo Heljanko, Stefan Haar
2015 arXiv   pre-print
Remarkably, the derived Petri net cannot execute any trace from the negative collection. The entire chain of transformations is fully automated.  ...  After deriving an intermediate net unfolding from them, we perform a controlled folding giving rise to a Petri net which contains both the input log and all independence-equivalent traces arising from  ...  A Petri net (PN) is a net together with an initial marking and a total function that labels its transitions over an alphabet A of observable actions.  ... 
arXiv:1507.02744v1 fatcat:yw6bk6vmhrfxtkl62y2vuv4ia4

New Region-Based Algorithms for Deriving Bounded Petri Nets

Josep Carmona, Jordi Cortadella, Mike Kishinevsky
2010 IEEE transactions on computers  
This paper tackles the problem of deriving a Petri net from a state-based model, using the theory of regions.  ...  One of these scenarios is Process Mining, where accepting (discovering) additional behavior in the synthesized Petri net is sometimes valued.  ...  More specifically, the theory of regions was used for transforming a transition system (TS) into a Petri net.  ... 
doi:10.1109/tc.2009.131 fatcat:eqmw24mgl5ebzdreuhmjx7rxou

Formal synthesis and code generation of embedded real-time software

Pao-Ann Hsiung
2001 Proceedings of the ninth international symposium on Hardware/software codesign - CODES '01  
In this work, a formal method based on TJrne Free-Choice Petri Nets (TFCPN) is proposed for ERTS synthesis.  ...  A B S T R A C T Due to rapidly increasing system complexity, shortening time-tomarket, and growing demand for hard real-time systems, formal methods are becoming indispensable in the synthesis of embedded  ...  System Model DEFINITION 1. : Time Free-Choice Petri Nets (TI~PN) A Twne Free-Choice Petri Net is a 5-topic (P, T, F, Mo, 1"), where: • P is a finite set of places, • T is a finite set of Iransitions,  ... 
doi:10.1145/371636.371729 dblp:conf/codes/Hsiung01 fatcat:kx2umcji2rdefckah3vnqo2c6i
« Previous Showing results 1 — 15 out of 1,770 results