國立虎尾科技大學 |

Application and Theory of Petri Nets and Concurrency = 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Application and Theory of Petri Nets and Concurrency/ edited by Didier Buchs, Josep Carmona.
其他題名:	42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings /
其他作者:	Buchs, Didier.
面頁冊數:	XI, 487 p. 146 illus., 59 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer science. -
電子資源:	https://doi.org/10.1007/978-3-030-76983-3
ISBN:	9783030769833

Application and Theory of Petri Nets and Concurrency = 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings /
Application and Theory of Petri Nets and Concurrency42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings /[electronic resource] :edited by Didier Buchs, Josep Carmona. - 1st ed. 2021. - XI, 487 p. 146 illus., 59 illus. in color.online resource. - Theoretical Computer Science and General Issues,127342512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Keynotes -- Topics in Region Theory and Synthesis Problems -- Flat Petri Nets -- Application of Concurrency to System Design -- Cost and Quality in Crowdsourcing Workflows -- Timed Petri Nets with Reset for Pipelined Synchronous Circuit Design -- A Turn-Based Approach for Qualitative Time Concurrent Games -- Games -- Canonical Representations for Direct Generation of Strategies in High-level Petri Games -- Automatic Synthesis of Transiently Correct Network Updates via Petri Games -- Verification -- Computing Parameterized Invariants of Parameterized Petri Nets -- On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets -- Skeleton Abstraction for Universal Temporal Properties -- Reduction Using Induced Subnets To Systematically Prove Properties For Free-Choice Nets -- Model Checking of Synchronized Domain-Specific Multi-Formalism Models Using High-Level Petri Nets -- Synthesis and Mining -- Edge and event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable -- Synthesis of (Choice-Free) Reset Nets -- Synthesis of Petri Nets with restricted place-environments: classical and parameterized -- Discovering Stochastic Process Models By Reduction and Abstraction -- Reachability and Partial Order -- Efficient Algorithms for Three Reachability Problems in Safe Petri Nets -- A Lazy Query Scheme for Reachability Analysis in Petri nets -- Abstraction-based Incremental Inductive Coverability for Petri nets -- Firing Partial Orders in a Petri Net -- Semantics -- Deterministic concurrent systems -- Deciphering the Co-car Anomaly of Circular Traffic Queues using Petri Nets -- Tools -- Cortado — An Interactive Tool for Data-Driven Process Discovery and Modeling -- PROVED: A Tool for Graph Representation and Analysis of Uncertain Event Data.

This book constitutes the proceedings of the 42nd International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2021, which was held virtually in June 2021. The 22 full papers presented together with 2 keynote papers in this volume were carefully reviewed and selected from 39 submissions. The focus of the conference is on the following topics: application of concurrency to system design; games; verification; synthesis and mining; reachability and partial order; semantics; and tools.

ISBN: 9783030769833

Standard No.: 10.1007/978-3-030-76983-3doiSubjects--Topical Terms:

573171
Computer science.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Application and Theory of Petri Nets and Concurrency = 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings /
LDR:03891nam a22004095i 4500 001 1059337
003 DE-He213
005 20220223022955.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030769833 $9 978-3-030-76983-3
024 7 $a 10.1007/978-3-030-76983-3 $2 doi
035 $a 978-3-030-76983-3
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Application and Theory of Petri Nets and Concurrency $h [electronic resource] : $b 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings / $c edited by Didier Buchs, Josep Carmona.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XI, 487 p. 146 illus., 59 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12734
505 0 $a Keynotes -- Topics in Region Theory and Synthesis Problems -- Flat Petri Nets -- Application of Concurrency to System Design -- Cost and Quality in Crowdsourcing Workflows -- Timed Petri Nets with Reset for Pipelined Synchronous Circuit Design -- A Turn-Based Approach for Qualitative Time Concurrent Games -- Games -- Canonical Representations for Direct Generation of Strategies in High-level Petri Games -- Automatic Synthesis of Transiently Correct Network Updates via Petri Games -- Verification -- Computing Parameterized Invariants of Parameterized Petri Nets -- On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets -- Skeleton Abstraction for Universal Temporal Properties -- Reduction Using Induced Subnets To Systematically Prove Properties For Free-Choice Nets -- Model Checking of Synchronized Domain-Specific Multi-Formalism Models Using High-Level Petri Nets -- Synthesis and Mining -- Edge and event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable -- Synthesis of (Choice-Free) Reset Nets -- Synthesis of Petri Nets with restricted place-environments: classical and parameterized -- Discovering Stochastic Process Models By Reduction and Abstraction -- Reachability and Partial Order -- Efficient Algorithms for Three Reachability Problems in Safe Petri Nets -- A Lazy Query Scheme for Reachability Analysis in Petri nets -- Abstraction-based Incremental Inductive Coverability for Petri nets -- Firing Partial Orders in a Petri Net -- Semantics -- Deterministic concurrent systems -- Deciphering the Co-car Anomaly of Circular Traffic Queues using Petri Nets -- Tools -- Cortado — An Interactive Tool for Data-Driven Process Discovery and Modeling -- PROVED: A Tool for Graph Representation and Analysis of Uncertain Event Data.
520 $a This book constitutes the proceedings of the 42nd International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2021, which was held virtually in June 2021. The 22 full papers presented together with 2 keynote papers in this volume were carefully reviewed and selected from 39 submissions. The focus of the conference is on the following topics: application of concurrency to system design; games; verification; synthesis and mining; reachability and partial order; semantics; and tools.
650 0 $a Computer science. $3 573171
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Information theory. $3 595305
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Software engineering. $3 562952
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 1365757
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Software Engineering. $3 669632
700 1 $a Buchs, Didier. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1360762
700 1 $a Carmona, Josep. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1199763
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030769826
776 0 8 $i Printed edition: $z 9783030769840
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-76983-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)