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

Persistent ET0L systems

On the Subword Complexity of Locally Catenative DOL Languages ; CU-CS-231-82

Combinatorial properties of dependence graphs are considered. In particular, a characterization is given of sets of unlabelled transitive graphs that can be labelled according to a dependence alphabet.

Combinatorial properties of dependence graphs

Abstract Let Σ be an arbitrary fixed alphabet. The direct copying relation (over Σ+) is a binary relation defined by: x copy y if and only if x = x1ux2 and y = x1uux2 for some words x1,x2,u where u is nonempty. The copying relation copy∗ is defined as the reflexive and transitive closure of copy. A copying system is an ordered pair G = (Σ, w) where w ϵΣ+; its language is L(G) = {zϵΣ + : w copy ∗ z} , it is referred to as a copy language. This note provides a sufficient condition for a copy language to be regular; an application of this condition is demonstrated.

Grzegorz Rozenberg

Papers

Persistent ET0L systems

On the Subword Complexity of Locally Catenative DOL Languages ; CU-CS-231-82

Combinatorial properties of dependence graphs

On Regularity of Languages Generated by Copying Systems ; CU-CS-234-82

Partial (Set) 2-Structures, Part I: Representation Problems ; CU-CS-340-86