Cantitate/Preț
Produs
Total produse
Vezi coșul
Application and Theory of Petri Nets and Concurrency: 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings de Didier Buchs

Application and Theory of Petri Nets and Concurrency: 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23–25, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12734

Editat de Didier Buchs, Josep Carmona
en Limba Engleză Paperback – 21 mai 2021
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32538 lei

Preț vechi: 40673 lei
-20% Nou

Puncte Express: 488
Preț estimativ în valută:
6227€ • 6612$ • 5159£

Carte tipărită la comandă

Livrare economică 26 decembrie 24 - 09 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030769826
ISBN-10: 3030769828
Pagini: 487
Ilustrații: XI, 487 p. 146 illus., 59 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.69 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.