Synthesis and analysis of process networks by joint application of P-graphs and Petri nets

Rozália Lakner, F. Friedler, B. Bertók

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Due to the increasing complexity of human developed systems computer aid plays key role in engineering design involving process synthesis and analysis. The P-graph framework provides effective algorithms implemented in software to synthesize optimal process systems constructed from potential building blocks leading from the available resources to the desired targets. P-graph software computes both the optimal structure and the optimal parameter values of a process system, however, does not provide information on the dynamics of the system synthesized. In contrast Petri nets are tools for simulation and analysis of complex systems’ dynamic behavior. They can model the operation of a preliminarily well-defined process network, but they are inappropriate for synthesizing the optimal process structure. The present work suggests joint application of the methods mentioned above combining effective synthesis algorithms from the P-graph framework with the modeling strength of Petri nets, illustrated by identification of feasible reaction pathways.

Original languageEnglish
Title of host publicationApplication and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings
PublisherSpringer Verlag
Pages309-329
Number of pages21
ISBN (Print)9783319578606
DOIs
Publication statusPublished - Jan 1 2017
Event38th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2017 - Zaragoza, Spain
Duration: Jun 25 2017Jun 30 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10258 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other38th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2017
CountrySpain
CityZaragoza
Period6/25/176/30/17

Fingerprint

Petri nets
Petri Nets
Synthesis
Graph in graph theory
Large scale systems
Computer systems
Software
Optimal Parameter
Complex Dynamics
Engineering Design
System Dynamics
Building Blocks
Design Process
Dynamic Behavior
Well-defined
Pathway
Complex Systems
Resources
Target
Modeling

Keywords

  • P-graph (process graph)
  • Petri net
  • Process network synthesis
  • Reaction pathway identification

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lakner, R., Friedler, F., & Bertók, B. (2017). Synthesis and analysis of process networks by joint application of P-graphs and Petri nets. In Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings (pp. 309-329). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10258 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-57861-3_18

Synthesis and analysis of process networks by joint application of P-graphs and Petri nets. / Lakner, Rozália; Friedler, F.; Bertók, B.

Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings. Springer Verlag, 2017. p. 309-329 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10258 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lakner, R, Friedler, F & Bertók, B 2017, Synthesis and analysis of process networks by joint application of P-graphs and Petri nets. in Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10258 LNCS, Springer Verlag, pp. 309-329, 38th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2017, Zaragoza, Spain, 6/25/17. https://doi.org/10.1007/978-3-319-57861-3_18
Lakner R, Friedler F, Bertók B. Synthesis and analysis of process networks by joint application of P-graphs and Petri nets. In Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings. Springer Verlag. 2017. p. 309-329. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-57861-3_18
Lakner, Rozália ; Friedler, F. ; Bertók, B. / Synthesis and analysis of process networks by joint application of P-graphs and Petri nets. Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings. Springer Verlag, 2017. pp. 309-329 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0a5de66c0944465f963f32dd8e7729e6,
title = "Synthesis and analysis of process networks by joint application of P-graphs and Petri nets",
abstract = "Due to the increasing complexity of human developed systems computer aid plays key role in engineering design involving process synthesis and analysis. The P-graph framework provides effective algorithms implemented in software to synthesize optimal process systems constructed from potential building blocks leading from the available resources to the desired targets. P-graph software computes both the optimal structure and the optimal parameter values of a process system, however, does not provide information on the dynamics of the system synthesized. In contrast Petri nets are tools for simulation and analysis of complex systems’ dynamic behavior. They can model the operation of a preliminarily well-defined process network, but they are inappropriate for synthesizing the optimal process structure. The present work suggests joint application of the methods mentioned above combining effective synthesis algorithms from the P-graph framework with the modeling strength of Petri nets, illustrated by identification of feasible reaction pathways.",
keywords = "P-graph (process graph), Petri net, Process network synthesis, Reaction pathway identification",
author = "Roz{\'a}lia Lakner and F. Friedler and B. Bert{\'o}k",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-57861-3_18",
language = "English",
isbn = "9783319578606",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "309--329",
booktitle = "Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings",

}

TY - GEN

T1 - Synthesis and analysis of process networks by joint application of P-graphs and Petri nets

AU - Lakner, Rozália

AU - Friedler, F.

AU - Bertók, B.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Due to the increasing complexity of human developed systems computer aid plays key role in engineering design involving process synthesis and analysis. The P-graph framework provides effective algorithms implemented in software to synthesize optimal process systems constructed from potential building blocks leading from the available resources to the desired targets. P-graph software computes both the optimal structure and the optimal parameter values of a process system, however, does not provide information on the dynamics of the system synthesized. In contrast Petri nets are tools for simulation and analysis of complex systems’ dynamic behavior. They can model the operation of a preliminarily well-defined process network, but they are inappropriate for synthesizing the optimal process structure. The present work suggests joint application of the methods mentioned above combining effective synthesis algorithms from the P-graph framework with the modeling strength of Petri nets, illustrated by identification of feasible reaction pathways.

AB - Due to the increasing complexity of human developed systems computer aid plays key role in engineering design involving process synthesis and analysis. The P-graph framework provides effective algorithms implemented in software to synthesize optimal process systems constructed from potential building blocks leading from the available resources to the desired targets. P-graph software computes both the optimal structure and the optimal parameter values of a process system, however, does not provide information on the dynamics of the system synthesized. In contrast Petri nets are tools for simulation and analysis of complex systems’ dynamic behavior. They can model the operation of a preliminarily well-defined process network, but they are inappropriate for synthesizing the optimal process structure. The present work suggests joint application of the methods mentioned above combining effective synthesis algorithms from the P-graph framework with the modeling strength of Petri nets, illustrated by identification of feasible reaction pathways.

KW - P-graph (process graph)

KW - Petri net

KW - Process network synthesis

KW - Reaction pathway identification

UR - http://www.scopus.com/inward/record.url?scp=85019245191&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85019245191&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-57861-3_18

DO - 10.1007/978-3-319-57861-3_18

M3 - Conference contribution

AN - SCOPUS:85019245191

SN - 9783319578606

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 309

EP - 329

BT - Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Proceedings

PB - Springer Verlag

ER -