Journal ArticleDOI
An Algorithm for the General Petri Net Reachability Problem
Reads0
Chats0
TLDR
An algorithm is presented for the general Petri net reachability problem, based on a generalization of the basic reachability tree construction which is made symmetric with respect to the initial and final marking.Abstract:
An algorithm is presented for the general Petri net reachability problem. It is based on a generalization of the basic reachability tree construction which is made symmetric with respect to the ini...read more
Citations
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Proceedings ArticleDOI
Simulation, verification and automated composition of web services
TL;DR: This paper defines the semantics for a relevant subset of DAML-S in terms of a first-order logical language and provides decision procedures for Web service simulation, verification and composition.
Journal ArticleDOI
Reasoning about systems with many processes
TL;DR: Methods are given for automatically verifying temporal properties of concurrent systems containing an arbitrary number of finite-state processes that communicate using CCS actions and how these decision procedures can be used to reason about certain systems with a communication network.
Journal ArticleDOI
A Survey of Petri Net Methods for Controlled Discrete EventSystems
TL;DR: An overview of the various models and problems formulated in the literature focusing on two particular models, the controlled Petri nets and the labeled nets, and two efficient techniques for the on-line computation of the control law.
Proceedings ArticleDOI
Decidability of reachability in vector addition systems (Preliminary Version)
TL;DR: A convincing proof of the decidability of reachability in vector addition systems is presented, and the complicated tree constructions in the earlier proofs are completely eliminated.