A theory of implementation and refinement in timed Petri nets

Felder, Miguel; Gargantini, Angelo; Morzenti, Angelo

doi:10.1016/s0304-3975(97)00078-9

Cited by 14 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The tokens are removed from places connected to the transition by an input arc; the tokens arrive in places connected to the transition by an output arc [3]. A place/transition net N is a triple N = (P, T, A) where [7]:…”

Section: Timed Petri Netsmentioning

confidence: 99%

Analysis Task Scheduling Models based on Hierarchical Timed Marked Graph

Cao²

2010

International Journal of Contents

View full text Add to dashboard Cite

show abstract

Section: Timed Petri Netsmentioning

confidence: 99%

Analysis Task Scheduling Models based on Hierarchical Timed Marked Graph

Cao²

2010

International Journal of Contents

View full text Add to dashboard Cite

show abstract

“…Gurovič et al [2000] introduce a refinement technique into TPN, define a type of refinement operations of TPN, and apply these operations to hierarchical modeling and analysis of traffic control systems. Felder et al [1998] mainly study the temporal semantic preservation of refinement operations. They establish TRIO formulas for the temporal semantic representation of TPN, and define a set of refinement rules that satisfy temporal semantic preservation.…”

Section: Introductionmentioning

confidence: 99%

Design, Analysis and Verification of Real-Time Systems Based on Time Petri Net Refinement

Ding

Jiang

Zhou

2013

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

A type of refinement operations of time Petri nets is presented for design, analysis and verification of complex real-time systems. First, the behavior preservation is studied under time constraints in a refinement operation, and a sufficient condition for behavior preservation is obtained. Then, the property preservation is considered, and the results indicate that if the refinement operation of time Petri nets satisfies behavior preservation, it can also preserve properties such as boundedness and liveness. Finally, based on the behavior preservation, a reachability decidability algorithm of a refined time Petri net is designed using the reachability trees of its original net and subnet. The research results are illustrated by an example of designing, analyzing and verifying a real-time manufacturing system. ACM Reference Format:Ding, Z., Jiang, C., and Zhou, M. 2013. Design, analysis and verification of real-time systems based on time Petri net refinement.

show abstract

“…B. Acu and W. Reisig introduce a refinement method, namely to thin the abstract transition in cursory main business process into more specific sub business process, to obtain more accurate business process [1]. M. Felder and A. Gargantinib et al proposed a theory of implementation and refinement in timed Petri nets and presented the proof that properties are remained before and after refinement [2]. C. Ferreira and M. Butler discussed the process refinement of compensation business process and explicitly embedded the behavior and compensation information of StAC into B to realize the refinement of business process [3].…”

Section: Introductionmentioning

confidence: 99%

A Compensation Paired Net-based Refinement Method for Web Services Composition

Mei¹,

Jiang²,

Li³

et al. 2011

AISS

View full text Add to dashboard Cite

With the development of advanced Internet technology, business applications across multiple enterprises based on Web Services Composition (WSC) paradigm are widely used. When system failure occurs, some tasks of the flow may be committed while others unscheduled, in this situation, it is important to accurately analyze execution log of composition business process. In this paper, we formally defines Web services composition compensation based on paired net, and analyze execution logs, dataflow dependency and behavior dependency between tasks in composition process, and discuss the refinement for Web services composition compensation process and the abstract replacement of complex compensation process. The classical composition transaction application Trip Reservation Process (TRP) shows the feasibility of ensuring consistent execution of reliable composition.

show abstract

A theory of implementation and refinement in timed Petri nets

Cited by 14 publications

References 9 publications

Analysis Task Scheduling Models based on Hierarchical Timed Marked Graph

Analysis Task Scheduling Models based on Hierarchical Timed Marked Graph

Design, Analysis and Verification of Real-Time Systems Based on Time Petri Net Refinement

A Compensation Paired Net-based Refinement Method for Web Services Composition

Contact Info

Product

Resources

About