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

A labeled 2-structure, l2s for short, is a complete edge-labeled directed graph without loops or multiple edges. An important result of the theory of 2-structures is the existence of a hierarchical representation of each l2s. A δ-reversible labeled 2-structure g will be identified with its labeling function that maps each edge (x, y), x ≠ y, of the domain D into a group Δ so that g(y, x)=δ(g(x, y)) for an involution δ of Δ. For each mapping (selector) Δ:D → ‡ a δ-reversible 2-structure gσ is obtained from g by gσ(x, y)=ρ(x)g(x, y)δ(ρ(y)). A dynamic δ-reversible 2-structure G=[g] generated by g is the set {gσ¦ σ a selector}. We define the plane trees of G to capture the hierarchical representation of G as seen by individual elements of the domain. We show that all the plane trees are strongly related to each other. Indeed, they are all obtainable from one simple unrooted undirected tree — the form of G. Thus, quite surprisingly, all hierarchical representations of l2s's belonging to one dynamic l2s G can be combined into one hierarchical representation of G.

Group Based Graph Transformations and Hierarchical Representations of Graphs

Node-label controlled graph grammars (Extended abstract)

The notion of a dynamic labeled 2-structure is introduced and investigated. It generalizes the notion of a labeled 2-structure (l2s), see [ER1], by making it possible to change the (label) relationships between the nodes. This is achieved by storing in the nodes of a l2s output and input functions which can change the outgoing and incoming labels, respectively. The notion of a clan which is central in the theory of l2s's is transferred to the framework of dl2s's, and the basic properties of clans of dl2s's are investigated.

An introduction to dynamic labeled 2-structures

On inherently ambiguous E0L languages

In this paper we consider simple EOL forms (forms with a single terminal and single nonterminal) under uniform interpretations. We present a contribution to the analysis of generative power of simple EOL forms by establishing easily decidable necessary and sufficient conditions for simple EOL forms to generate (under uniform interpretations) CF languages only.

Grzegorz Rozenberg

Papers

Group Based Graph Transformations and Hierarchical Representations of Graphs

Node-label controlled graph grammars (Extended abstract)

An introduction to dynamic labeled 2-structures

On inherently ambiguous E0L languages

Simple EOL forms under uniform interpretation generating CF languages