Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >

/pdf/petri-nets-properties-analysis-and-applications-43jwyjdxr0.pdf

Petri nets: Properties, analysis and applications

Data Mining Practical Machine Learning Tools and Techniques

https://cmi.ac.in/~madhavan/courses/verification-2011/alur-dill-tcs-94.pdf

A theory of timed automata

物件導向軟體之架構(Object-Oriented Software Construction)探討

The Temporal Logic of Reactive and Concurrent Systems: Specification

Separated handle-rewriting hypergraph grammars (S-HH grammars) are introduced, where separated means that the nonterminal handles are disjoint. S-HH grammars have the same graph generating power as the vertex rewriting context-free NCE graph grammars, and as recursive systems of equations with four types of simple operations on graphs.

Context-free Handle-rewriting Hypergraph Grammars

Sticker systems

— It is shown that there exist context free languages which are not deterministic ETOL languages. The proof is based on an analysis of the structure of dérivations in deterministic ETOL Systems.

/pdf/on-some-context-free-languages-that-are-not-deterministic-42547xuls9.pdf

On some context free languages that are not deterministic ETOL languages

Two formalisms, called POT and POP, are introduced for modelling parallel object-based systems. The first formalism is on the level of transition systems and the second on the program level. Both formalisms are based on Petri nets. A POT is obtained from a Petri net by the addition of components that handle specific object-based features such as object identity, object creation (and destruction), private memory of objects, and references to objects. Parallelism and synchronization are handled by the Petri net. A POP is a program that may be viewed as an abbreviation of a (usually infinite) POT, comparable to a high-level Petri net.

Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs

A reaction system is essentially a finite set of reactions, where each reaction consists of a finite set of reactants (needed for the reaction to take place), a finite set of inhibitors (each of which inhibits the reaction from taking place), and a finite set of products produced when the reaction takes place A crucial feature of a reaction system is that (unless introduced from outside the system) an element (entity) from a current state will belong also to the successor state only if it is in the product set of a reaction that took place in the current state In other words, an entity vanishes unless it is sustained by a reaction -- a sort of "immediate decay" property In this paper we relax this property, by providing each entity x with its duration d(x), which guarantees that x will last through at least d(x) consecutive states Such reaction systems with duration are investigated in this paper Among others we demonstrate that duration/decay is a result of an interaction with a "structured environment", and we also investigate fundamental properties of state sequences of reaction systems with duration

Grzegorz Rozenberg

Papers

Context-free Handle-rewriting Hypergraph Grammars

Sticker systems

On some context free languages that are not deterministic ETOL languages

Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs

Reaction systems with duration