[图书][B] Unfoldings: a partial-order approach to model checking
J Esparza, K Heljanko - 2008 - books.google.com
Model checking is a prominent technique used in the hardware and software industries for
automatic verification. While it is very successful in finding subtle bugs in distributed …
automatic verification. While it is very successful in finding subtle bugs in distributed …
[图书][B] Dynamic analysis of Petri net-based discrete systems
A Karatkevich - 2007 - books.google.com
Design of modern digital hardware systems and of complex software systems is almost
always connected with parallelism. For example, execution of an object-oriented p-gram can …
always connected with parallelism. For example, execution of an object-oriented p-gram can …
On-line monitoring of large Petri net models under partial observation
G Jiroveanu, RK Boel, B Bordbar - Discrete Event Dynamic Systems, 2008 - Springer
Abstract We consider a Petri Net model of the plant. The observation is given by a subset of
transitions whose occurrence is always and immediately sensed by a monitoring agent …
transitions whose occurrence is always and immediately sensed by a monitoring agent …
The unfolding: Origins, techniques, and applications within discrete event systems
Y Rouabah, Z Li - Mathematics, 2022 - mdpi.com
This article aims to provide a perspective on the foundations and developments of the net
unfolding techniques and their applications to discrete event systems. The numerous …
unfolding techniques and their applications to discrete event systems. The numerous …
Deadlock detection-oriented unfolding of unbounded Petri nets
The state-space explosion obstructs Petri nets for large-scale system analysis. Net unfolding
techniques have drawn considerable attention to solve this problem. However, existing …
techniques have drawn considerable attention to solve this problem. However, existing …
Taking Complete Finite Prefixes To High Level, Symbolically
N Würdemann, T Chatain, S Haar… - Fundamenta …, 2024 - journals.sagepub.com
Unfoldings are a well known partial-order semantics of P/T Petri nets that can be applied to
various model checking or verification problems. For high-level Petri nets, the so-called …
various model checking or verification problems. For high-level Petri nets, the so-called …
Direct verification of BPMN processes through an optimized unfolding technique
Business process analysis is one of the most important and complex activities of Business
Process Management. Business processes are typically defined by business experts which …
Process Management. Business processes are typically defined by business experts which …
From many places to few: Automatic abstraction refinement for Petri nets
Current algorithms for the automatic verification of Petri nets suffer from the explosion
caused by the high dimensionality of the state spaces of practical examples. In this paper …
caused by the high dimensionality of the state spaces of practical examples. In this paper …
Finite unfoldings of unbounded petri nets
J Desel, G Juhás, C Neumair - … Conference on Application and Theory of …, 2004 - Springer
The aim of this paper is to introduce a concept for an efficient representation of the behavior
of an unbounded Petri net. This concept combines a known method for the description of …
of an unbounded Petri net. This concept combines a known method for the description of …
A false history of true concurrency: From Petri to tools
J Esparza - International SPIN Workshop on Model Checking of …, 2010 - Springer
A False History of True Concurrency: From Petri to Tools Page 1 A False History of True
Concurrency: From Petri to Tools Javier Esparza Institut für Informatik, Technische Universität …
Concurrency: From Petri to Tools Javier Esparza Institut für Informatik, Technische Universität …