Process graph: Difference between revisions

Revision as of 21:18, 16 December 2021

Revision as of 21:44, 17 September 2023

Line 6:

==Applications==

Process-graph is in use in different fields of application in Process Network Synthesis (PNS) .<ref>{{cite journal|last1=Friedler|first1=F.|last2=Huang|first2=Y.W.|last3=Fan|first3=L.T.|title=Combinatorial Algorithms for Process Synthesis|journal=Computers Chemical Engineering|date=1992|volume=16 |issue=Suppl. 1|pages=313–320|doi=10.1016/S0098-1354(09)80037-9}}</ref> An example for an application is [[Process Network Synthesis]].<ref>{{cite book|last1=Friedler|first1=F.|title=State of the Art in Global Optimization|volume=7|last2=Varga|first2=J. B.|last3=Feher|first3=E.|last4=Fan|first4=L. T.|date=1996|publisher=Kluwer Academic Publishers|___location=Dordrecht|pages=609–626|edition=7|isbn=978-0-7923-4351-6|doi=10.1007/978-1-4613-3437-8_35|chapter=Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis|series=Nonconvex Optimization and Its Applications}}</ref> The method is in scientific use to find optimum process chains in chemical formulas, energy technology networks and other optimisation problems like evacuation routes in buildings or transportation routes.

Process graphs are also used in understanding the control flow of multi-threaded processes. If there are n concurrent threads running, a process graph models the execution of n concurrent threads and their trajectories through an n dimensional Cartesian plane. The origin of the graph corresponds to the initial state where none of the threads have completed an instruction. Each directed edge corresponds to the execution of an instruction and transition to other. Valid edges can either go up or right because programs cannot run backward for the edges to left or down. Since two threads can't complete the same instruction at the same time, diagonal edges are not allowed.