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

Elementary Homomorphisms and a Solution of the DOL Sequence Equivalence Problem ; CU-CS-115-77

An Introduction to Context-free Text Grammars.

On the Structure of Polynomially Bounded DOL Systems ; CU-CS-023-73

This paper studies an extension of the notion of a finite index ETOL system It turns out that by setting some quite natural restrictions on the set of bare derivation trees of an ETOL system (that is derivation trees stripped of labels) one can characterize languages of finite rank Several properties of the new class of ETOL systems are investigated; in particular their relationship to ETOL systems of finite rank and ETOL systems of finite index is investigated

Grzegorz Rozenberg

Papers

Elementary Homomorphisms and a Solution of the DOL Sequence Equivalence Problem ; CU-CS-115-77

An Introduction to Context-free Text Grammars.

On the Structure of Polynomially Bounded DOL Systems ; CU-CS-023-73

On Etol Systems with Finite Tree-Rank

Properties of grammatical codes of trees