LEADER 05023nam 22007575 450 001 996464511603316 005 20230222065025.0 010 $a3-030-76983-6 024 7 $a10.1007/978-3-030-76983-3 035 $a(CKB)5590000000487491 035 $a(MiAaPQ)EBC6643613 035 $a(Au-PeEL)EBL6643613 035 $a(OCoLC)1257076483 035 $a(DE-He213)978-3-030-76983-3 035 $a(PPN)257358048 035 $a(EXLCZ)995590000000487491 100 $a20210520d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aApplication and Theory of Petri Nets and Concurrency$b[electronic resource] $e42nd International Conference, PETRI NETS 2021, Virtual Event, June 23?25, 2021, Proceedings /$fedited by Didier Buchs, Josep Carmona 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (487 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12734 300 $aIncludes index. 311 $a3-030-76982-8 327 $aKeynotes -- 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12734 606 $aComputer science 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aSoftware engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aDiscrete Mathematics in Computer Science 606 $aSoftware Engineering 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aSoftware engineering. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSoftware Engineering. 676 $a511.3 702 $aBuchs$b Didier 702 $aCarmona$b Josep 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464511603316 996 $aApplication and Theory of Petri Nets and Concurrency$91905519 997 $aUNISA