Optimization-Based Assessment of Initial-State Opacity in Petri Nets

Author(s):  
Gianmaria De Tommasi ◽  
Carlo Motta ◽  
Alberto Petrillo ◽  
Stefania Santini
Keyword(s):  
2008 ◽  
Vol 14 (3) ◽  
pp. 189-198 ◽  
Author(s):  
Khaled Nassar ◽  
Albert Casavant

Petri nets have been used for many years to model complex processes. Examples are software design, workflow management, data analysis, concurrent programming, reliability engineering, real‐time computing systems, operating systems, distributed systems, and biological processes. Timed petri nets enable the study of timed process reachability, i. e. can a certain state in the process be reached, given an initial state of TPN representing a given process. This paper shows how the reachability of TPN can be utilized to analyze several aspects of construction projects. TPN are introduced and contrasted to Activity Cycle Diagrams and are also formalized to allow for the reachability problem to be assessed. The benefits and limitations of the analysis are presented through the classic earth-moving problem. Santrauka Petri laiko tinklai jau daugelį metų yra taikomi sudėtingiems procesams modeliuoti. Jų pavyzdžiai yra programinės įrangos kūrimas, organizacinių procesų valdymas, duomenų analizė, vientisas planavimas, patikima inžinerija, kompiuterinės sistemos, operacinės sistemos, išskirstytos sistemos ir biologiniai procesai. Petri laiko tinklai leidžia tirti apibrėžtų procesų įvykdymo pasiekiamumą per nustatytą laiką, t. y. ar tam tikra proceso būklė gali būti pasiekta turint Petri laiko tinklų pradinę būseną, aprašančią procesą. Šiame straipsnyje parodoma, kaip Petri laiko tinklų pasiekiamumas gali būti pritaikytas statybos projektams analizuoti keliais aspektais. Apibūdinami Petri laiko tinklai yra gretinami su veiksmų ciklinėmis diagramomis ir suformuoti taip, kad būtų galima įvertinti pasiekiamumo problemas. Taip pat yra pristatomi analizės privalumai ir trūkumai nagrinėjant klasikinį žemės darbų uždavinį.


2020 ◽  
Vol 21 (4) ◽  
Author(s):  
Adel Benamira

Causal reversibility in concurrent systems means that events that the origin of other events can only be undone after undoing of its consequences. In opposite to backtracking, the events which are independent of each other can be reversed in an arbitrary order, in the other words, we have flexible reversibility w.r.t the causality relation. An implementation of Individual token interpretation ofPetri Nets (IPNs) was been proposed by Rob Van Glabbeek et al, the present paper investigates into a study of causal reversibility within IPNs. Given N be an IPN, by adding an intuitive firing rule to undo transitions according to the causality relation, the coherence of N is assured, i.e., the set of all reachable states of N in the reversible version and that of the original one are identical. Furthermore, reversibility in N is flexible and their initial state can be accessible in reverse from any state. In this paper an approach for controllingcausal-reversibility within IPNs is proposed.


2019 ◽  
Vol 93 ◽  
pp. 108-114 ◽  
Author(s):  
Xuya Cong ◽  
Maira Pia Fanti ◽  
Agostino Marcello Mangini ◽  
Zhiwu Li

Author(s):  
F. I. Grace

An interest in NiTi alloys with near stoichiometric composition (55 NiTi) has intensified since they were found to exhibit a unique mechanical shape memory effect at the Naval Ordnance Laboratory some twelve years ago (thus refered to as NITINOL alloys). Since then, the microstructural mechanisms associated with the shape memory effect have been investigated and several interesting engineering applications have appeared.The shape memory effect implies that the alloy deformed from an initial shape will spontaneously return to that initial state upon heating. This behavior is reported to be related to a diffusionless shear transformation which takes place between similar but slightly different CsCl type structures.


Sign in / Sign up

Export Citation Format

Share Document