|
|
|
|
| LEADER |
03945nmm a2200409 u 4500 |
| 001 |
EB001994080 |
| 003 |
EBX01000000000000001156982 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210702 ||| eng |
| 020 |
|
|
|a 9783030769833
|
| 100 |
1 |
|
|a Buchs, Didier
|e [editor]
|
| 245 |
0 |
0 |
|a Application and Theory of Petri Nets and Concurrency
|h Elektronische Ressource
|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
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2021, 2021
|
| 300 |
|
|
|a XI, 487 p. 146 illus., 59 illus. in color
|b online resource
|
| 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
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Data Structures and Information Theory
|
| 653 |
|
|
|a Design and Analysis of Algorithms
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data structures (Computer science)
|
| 653 |
|
|
|a Discrete mathematics
|
| 700 |
1 |
|
|a Carmona, Josep
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-030-76983-3
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-030-76983-3?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 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
|