Application and Theory of Petri Nets

Name: Application and Theory of Petri Nets | 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012, Proceedings

Serge Haddad Lucia Pomello(Herausgeber*in)

Springer (Verlag)

Erschienen am 6. Juni 2012

XI, 419 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-31131-4 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title
Preface
Organization
Table of Contents
Invited Papers
Net Models for Concurrent Object Behaviour
References
The Theory of WSTS: The Case of Complete WSTS
Introduction
Preliminaries
A Survey on Well-Structured Transition Systems
Well-Structured Transition Systems: From 1986 to 1996
WSTS Everywhere: From 1997 to 2012
Complete WSTS Are Better
Complete WSTS and Their Clovers
Completions
Completion of WSTS into Complete WSTS Is (Almost) Always Possible
Motivation
2-WSTS
Are 2-wqos Ubiquitous?
Effective Complete WSTS
A Conceptual Karp-Miller Procedure
Correctness and Termination of the Clover Procedure
Clover-Flattable Complete WSTS
Cover-Flattability (without the ``l'' in ``Cover'')
Well Structured Presburger Counter Systems
Conclusion and Perspectives
References
Regular Papers
Using Colored Petri Nets to Construct Coalescent Hidden Markov Models: Automatic Translation from Demographic Specifications to Efficient Inference Methods
Introduction
Modeling the Coalescent Process
The Coalescent Process
A Colored Petri Net Model for Pairwise Genealogies
Building Coalescent CTMCs from the Petri Net Specification
Constructing Sequential Markov Coalescent Models
Projecting Runs of the CPN Model onto Pairs of Genealogies
Dealing with Different Demographic Epochs
Results
State Space Statistics
Parameter Estimation
Discussion
Conclusions
References
An SMT-Based Discovery Algorithm for C-Nets
Introduction
Background
Mathematical Preliminaries
Causal Nets (C-Nets)
C-Net Discovery
Discovering Strategies for C-Nets Based on SMT
Protobinding Sequences of a Log
Encoding the Problem as Linear Constraints
Solving Linear Constraints Using SMT
Adding a Cost Function
The Algorithm
Encoding Other Types of Constraints
Experiments
Conclusion and Future Work
References
Decomposing Process Mining Problems Using Passages
Introduction
Preliminaries
Graphs, Passages, and Paths
Multisets
Petri Nets
WF-Net
Event Log
Conformance Checking
Distributed Conformance Checking
Process Discovery: Divide and Conquer
Related Work
Conclusion
References
Complexity of the Soundness Problem of Bounded Workflow Nets
Introduction
Preliminary
Petri Nets
WF-Nets
reWF-Nets
SAT Problem
LBA Acceptance Problem
co-NP-Hardness of the Soundness of Bounded WF-Nets
PSPACE-Hardness of the Soundness of Bounded reWF-Nets
Conclusion
References
Cost Soundness for Priced Resource-Constrained Workflow Nets
Introduction
Preliminaries
Priced Workflow-Nets
Priced Resource-Constrained wf-Nets
Selected Price Predicates
Sum and Max-Dynamic Soundness
Av-Dynamic Soundness
Ordered Prices
Conclusions and Open Problems
References
On the a-Reconstructibility of Workflow Nets
Introduction
Discovering Workflow Nets from Event Logs
Some Observations about the Algorithm
Reconstructible Workflow Nets
Boundary Places of a Workflow Net
Conclusion
References
On Profiles and Footprints - Relational Semantics for Petri Nets
Introduction
Preliminaries
A Spectrum of Relational Semantics
Overview
Parametrised Relation Sets
Equivalence of Relation Sets
Relation Sets for Distinguished Net Classes
S-WF-Systems
Free-Choice WF-Systems
Applications of Relational Semantics
Related Work
Conclusions
References
Data and Abstraction for Scenario-Based Modeling with Petri Nets
Introduction
Specifying with Scenarios
Running Example and Requirements for Capturing It
Principles of Scenario-Based Specifications
A Simple Model for Scenarios Based on Petri Nets
Adding Abstraction: Abstract Dependencies
Abstracting Causal Dependencies
Basic Notions
Runs with Abstract Dependencies
Scenarios with Abstract Dependencies
Operational Semantics
Adding Data: -Oclets
Specifying Data
Formalization
Operational Semantics
Complete Gas Pump Example
On the Relation of Oclets to Petri Nets
Conclusion and Future Work
References
Maximal Confluent Processes
Introduction
Motivating Examples
Maximal Confluent Processes
Coalescing Confluent Processes
Unfolding Procedure
Granular Configuration Structures
Unfolding TSes into GCSes
References
Old and New Algorithms for Minimal Coverability Sets
Introduction
Minimal Coverablity Sets
Basic Algorithm
Construction Order
To Prune or Not to Prune
Conclusion
References
Stubborn Sets for Simple Linear Time Properties
Introduction
Petri Nets
Model Checking with Büchi Automata
Simple Büchi Automata
Traditional LTL Preserving Stubborn Sets
Commutation
Invisibility
Non-ignorance
Our Approach to Stubborn Sets for Simple Properties
Stubborn Sets for Switching on Formulas
Preventing Formulas from Being Switched Off
Stubborn Sets for Elementary Büchi Automata
Comparison
Calculation of Stubborn Sets Using ILP Solving
Specification of the ILP Problem
Enumeration of Up-Sets
Experimental Validation
Related Work and Conclusion
References
Hybrid On-the-Fly LTL Model Checking with the Sweep-Line Method
Introduction
Background
LTL Model Checking
The Sweep-Line Method
A Sweep-Line Algorithm for LTL Model Checking
Combining NDFS and Sweep to Discover SLACs
Combining MAP and Sweep to Discover MLACs
Correctness Proof and Complexity of LTL-Sweep
Extensions
On-the-Fly MLAC Detection
Informed Search for MLACs
Using the Progress Measure to Order States
Experiments
Conclusion and Perspectives
References
Safety Slicing Petri Nets
Basic Definitions
CTL*-X Slicing
Safety Slicing
Proving Safety Slice's Properties
Related Work
Petri Net Slicing
Petri Net Reductions
Evaluation
Effect on the Full State Space
Partial Order Reductions
Conclusion and Future Work
References
Capacity Planning for Vertical Search Engines: An Approach Based on Coloured Petri Nets
Introduction
Background
Query Processing
Related Work
Modelling a Vertical Search Engine
Modelling the Communication Infrastructure
Front-Service (FS)
Caching-Service (CS)
Index-Service (IS)
A Performance Evaluation Study Using the CPN Model
Model Validation
Model Assessment
Evaluation Using a Switched LAN
Conclusions
References
An Infrastructure for Cost-Effective Testing of Operational Support Algorithms Based on Colored Petri Nets
Introduction
Background
Running Example and Declare.
Operational Support Architecture.
Cosimulation Using Access/CPN 2.0.
User Behavior Modeling
User Model
Pick Item Model.
Task Execution.
Recommendation Algorithms
Provider Model
Random Provider.
Batch Provider.
Model-Specific Provider.
Log-Based Recommender
Experiments
Random Provider
Batch Provider
Model-Specific Provider
Log Provider
Conclusion and Future Work
References
Designing Weakly Terminating ROS Systems
Introduction
Robot ROSE
The Robot Operating System
The Logical Model
Basic Notions
Components and Their Interaction
The GFR Pattern
The RPC Pattern
The Publish-Subscribe Pattern
The Construction Method
Architectural Diagram
Case Study: Navigation System
Conclusions
References
Nets-within-Nets to Model Innovative Space System Architectures
Introduction
ANC Model Features
ANC Model Structure
ANC Model Dynamics
Requirements for a Modeling Tool
From Nets-within-Nets to Reference Nets
Reference Nets and Renew
Some Renew Specific Features
Application
A Simplified ANC
Nets Description
Simulation and First Results
Conclusion and Further Work
References
P- and T-Systems in the Nets-within-Nets-Formalism
Introduction
Fundamentals
Generalised State Machines
The Reachability Problem for ppGSMs and ttGSMs
The Reachability Problem for ptGSMs and tpGSMs
Conclusion and Outlook
References
Tool Papers
Stochastic Modeling and Analysis Using QPME: Queueing Petri Net Modeling Environment v2.0
Introduction
Functionality
Queueing Petri net Editor (QPE)
Simulation of QPN Model (SimQPN)
Processing and Visualization of Simulation Results
Architecture
Use Cases
Comparison with Other Tools
Installation
Conclusion
References
Snoopy - A Unifying Petri Net Tool
Overview
Basic Functionalities
Net Class Specific Functionalities
Overview
Executability
Import/Export
Architecture
Applications
Comparison with Other Tools
Installation
References
CPN Assistant II: A Tool for Management of Networked Simulations
Introduction
Comparison with Other Tools
Functionality
Tool Architecture and Communication
Conclusions
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken