Filters








1,634 Hits in 4.9 sec

Embedded software synthesis and prototyping

Trong-Yen Lee, Pao-Ann Hsiung
2004 IEEE transactions on consumer electronics  
Complex-choice Petri nets are used to model embedded software, which are then synthesized using an extended quasi static scheduling algorithm.  ...  Several issues are solved, including software synthesis, software verification, code generation, and system emulation.  ...  Software synthesis method was proposed for a more general Petri-Net framework by Sgroi et al. [6] . A quasi-static scheduling algorithm was proposed for Free-Choice Petri Nets (FCPN) [6] .  ... 
doi:10.1109/tce.2004.1277888 fatcat:6eu6bhhil5dhfcxoqp2taiei3m

Synthesis of embedded software using free-choice Petri nets

Marco Sgroi, Luciano Lavagno, Yosinori Watanabe, Alberto Sangiovanni-Vincentelli
1999 Proceedings of the 36th ACM/IEEE conference on Design automation conference - DAC '99  
We use Free Choice Petri Nets (FCPNs), as underlying model, and define quasi-static schedulability for FCPNs.  ...  The choice of the scheduling policy mainly depends on the specification of the system.  ...  Conclusions In this paper we have proposed a software synthesis technique based on quasi-static scheduling of Free Choice Petri Nets.  ... 
doi:10.1145/309847.310073 dblp:conf/dac/SgroiL99 fatcat:edfcroqqjfdu7bycrgblvkhcy4

RESS: Real-Time Embedded Software Synthesis and Prototyping Methodology [chapter]

Trong-Yen Lee, Pao-Ann Hsiung, I-Mu Wu, Feng-Shi Su
2004 Lecture Notes in Computer Science  
Time Complex-choice Petri Nets are used to model realtime embedded software, which are then synthesized using a time extended quasi static scheduling algorithm.  ...  Several issues are solved, including software synthesis, software verification, code generation, graphic user interface, and system emulation.  ...  Software synthesis method was proposed for a more general Petri-Net framework by Sgroi et al. [6] . A quasi-static scheduling algorithm was proposed for Free-Choice Petri Nets (FCPN) [6] .  ... 
doi:10.1007/978-3-540-24686-2_33 fatcat:r5dsjnz5rfhexb57faslqpzwge

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.  ...  Finally, an application example is given to illustrate the feasibility of the proposed TFCPN-based formal method for ERTS synthesis. K e y w o r d s  ...  An embedded real-time software is specified as a set of T#ne Free-Choice Petri Nets (TFCPN), which are time extensions of Frce-Choice Petri Nets (FCPN) [16] .  ... 
doi:10.1145/371636.371729 dblp:conf/codes/Hsiung01 fatcat:kx2umcji2rdefckah3vnqo2c6i

Extended quasi-static scheduling for formal synthesis and code generation of embedded software

Feng-Shi Su, Pao-Ann Hsiung
2002 Proceedings of the tenth international symposium on Hardware/software codesign - CODES '02  
Petri Nets (CCPN) model.  ...  Our method improves on previous work in three ways: (1) by removing model restrictions to cover a much wider range of applications, (2) by proposing an extended algorithm to schedule the more unrestricted  ...  A software synthesis method was proposed for a more general Petri-Net framework by Sgroi et al. [14] . A quasi-static scheduling algorithm was proposed for Free-Choice Petri Nets (FCPN) [14] .  ... 
doi:10.1145/774789.774832 dblp:conf/codes/SuH02 fatcat:pkfng2ujjrcrdo5ifc7dgt5ooi

Synthesis of real-time embedded software with local and global deadlines

Pao-Ann Hsiung, Cheng-Yi Lin
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
Through this scheduling procedure, we are able to formally synthesize real-time embedded software from a network of Real-Time Petri Nets specification.  ...  We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both local and global deadlines, while satisfying all precedence constraints among subtasks and among tasks.  ...  A quasi-static scheduling (QSS) algorithm was proposed for Free-Choice Petri Nets (FCPN) [17] . A necessary and sufficient condition was given for a FCPN to be schedulable.  ... 
doi:10.1145/944678.944679 fatcat:cehvmud2abgwnp2gmo3qfbuapq

Extended quasi-static scheduling for formal synthesis and code generation of embedded software

Feng-Shi Su, Pao-Ann Hsiung
2002 Proceedings of the tenth international symposium on Hardware/software codesign - CODES '02  
Petri Nets (CCPN) model.  ...  Our method improves on previous work in three ways: (1) by removing model restrictions to cover a much wider range of applications, (2) by proposing an extended algorithm to schedule the more unrestricted  ...  A software synthesis method was proposed for a more general Petri-Net framework by Sgroi et al. [14] . A quasi-static scheduling algorithm was proposed for Free-Choice Petri Nets (FCPN) [14] .  ... 
doi:10.1145/774827.774832 fatcat:ak5dcjyoufg45gkffroo7733gm

Synthesis and Analysis of Product-form Petri Nets [article]

Serge Haddad
2012 arXiv   pre-print
Here we address three relevant issues for product-form Petri nets which were left fully or partially open: (1) we provide a sound and complete set of rules for the synthesis; (2) we characterise the exact  ...  Being first introduced in queueing networks, it has been adapted to Markovian Petri nets.  ...  For instance, in [12] , a sound and complete set of rules is proposed for the synthesis of live and bounded free-choice nets. Is it possible to get an analog for product-form Petri nets?  ... 
arXiv:1104.0291v2 fatcat:ky5m2ncnvjae7eibzchktin74m

Synthesis of real-time embedded software with local and global deadlines

Pao-Ann Hsiung, Cheng-Yi Lin
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
Through this scheduling procedure, we are able to formally synthesize real-time embedded software from a network of Real-Time Petri Nets specification.  ...  We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both local and global deadlines, while satisfying all precedence constraints among subtasks and among tasks.  ...  A quasi-static scheduling (QSS) algorithm was proposed for Free-Choice Petri Nets (FCPN) [17] . A necessary and sufficient condition was given for a FCPN to be schedulable.  ... 
doi:10.1145/944645.944679 dblp:conf/codes/HsiungL03 fatcat:6p5lqajt5na53nq36g67rr4woe

Synthesis of Reduced Asymmetric Choice Petri Nets [article]

Harro Wimmel
2019 arXiv   pre-print
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  ...  Choice-free nets have strong properties, allowing to often easily detect when synthesis will fail or at least to quicken the synthesis.  ...  Equal-conflict nets can be synthesised in polynomial worst case complexity. For free-choice synthesis no such result is known due to the limit on arc weights, but at least an algorithm in NP exists.  ... 
arXiv:1911.09133v2 fatcat:hsf5irfs3ngmxornpebf2evpby

Reducing probabilistic timed petri nets for asynchronous architectural analysis

Sangyun Kim, Sunan Tugsinavisut, Peter Beerel
2002 Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems - TAU '02  
Petri net model.  ...  This paper introduces structural reductions of probabilistic timed Petri nets that preserve a large class of performance measurements.  ...  In particular, we restrict ourselves to LB nets with free-choice and unique-choice places.  ... 
doi:10.1145/589411.589441 dblp:conf/tau/KimTB02 fatcat:3uwgdnlpcvgpdhbm5wtifmlhpu

Synthesis and Analysis of Product-Form Petri Nets [chapter]

S. Haddad, J. Mairesse, H-T. Nguyen
2011 Lecture Notes in Computer Science  
Here we address three relevant issues for product-form Petri nets which were left fully or partially open: (1) we provide a sound and complete set of rules for the synthesis; (2) we characterise the exact  ...  Being first introduced in queueing networks, it has been adapted to Markovian Petri nets.  ...  It is proved in [15] that the intersection of free-choice and product-form Petri nets is the class of Jackson networks [11] .  ... 
doi:10.1007/978-3-642-21834-7_16 fatcat:vwso3nxkbbch7n7yya5mxujpwi

Reducing probabilistic timed petri nets for asynchronous architectural analysis

Sangyun Kim, Sunan Tugsinavisut, Peter Beerel
2002 Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems - TAU '02  
Petri net model.  ...  This paper introduces structural reductions of probabilistic timed Petri nets that preserve a large class of performance measurements.  ...  In particular, we restrict ourselves to LB nets with free-choice and unique-choice places.  ... 
doi:10.1145/589436.589441 fatcat:55utawuilrbdnjwwrgh24lusvy

Component-based synthesis for complex APIs

Yu Feng, Ruben Martins, Yuepeng Wang, Isil Dillig, Thomas W. Reps
2017 SIGPLAN notices  
In this paper, we present a novel type-directed algorithm for component-based synthesis.  ...  The key novelty of our approach is the use of a compact Petri-net representation to model relationships between methods in an API.  ...  Petri-net construction. The first step of our synthesis algorithm is to construct a Petri net using signatures of components in Λ.  ... 
doi:10.1145/3093333.3009851 fatcat:kezp55zfhvgzfmelo36fsahupe

Component-based synthesis for complex APIs

Yu Feng, Ruben Martins, Yuepeng Wang, Isil Dillig, Thomas W. Reps
2017 Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017  
In this paper, we present a novel type-directed algorithm for component-based synthesis.  ...  The key novelty of our approach is the use of a compact Petri-net representation to model relationships between methods in an API.  ...  Petri-net construction. The first step of our synthesis algorithm is to construct a Petri net using signatures of components in Λ.  ... 
doi:10.1145/3009837.3009851 fatcat:h5t5u6fhejfprf3soxqknu4vga
« Previous Showing results 1 — 15 out of 1,634 results