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

Reaction systems are a formal model of interactions between biochemical reactions. They are based on the observation that two basic mechanisms behind the functioning of biochemical reactions are facilitation and inhibition. In this paper we continue the investigation of reaction systems, and in particular we introduce the notion of a module, and then we investigate the formation and evolution of modules. Among others we prove that reaction systems can be viewed as self-organizing systems, where the organizing goal is to ensure a specific property of the set of all modules (of a state of a process).

Events and modules in reaction systems

In this paper we consider networks of membranes which compute by communication only, using symport/antiport rules. Such rules are used both for communication with the environment and for direct communication among membranes. It turns out that, rather surprisingly, networks with a small number of membranes are computationally universal. This is proved both for the case of three membranes where each membrane communicates with each other membrane, and for the case of four membranes consisting of two pairs such that only the membranes within each pair communicate directly. A single pair of communicating membranes can compute the Parikh images of matrix languages. Several open problems are also formulated.

Computing by communication in networks of membranes

An elementary introduction to the notion of an NLC graph grammar is given, and several of its extensions and variations are discussed in a systematic way. Simple concepts are considered rather than technical details.

https://link.springer.com/content/pdf/10.1007%2FBFb0017374.pdf

Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars

Suppose given two of the following: a set L1 of start words, a set L2 of target words, and a control set C of finite sequences of applications of a given finite set of homomorphisms (or finite substitutions) which map L1 into L2. Using notions from OL systems, the present paper investigates what can be said about the remaining set in case the given sets are regular. When the start and target sets are regular, the set of all control words turns out to be regular. (This is true even when the regularity assumption on the start set is removed.) When a regular target set L2 and a regular control set C are given, the set of all words map ped into L2 by C is regular. (This result remains true even when the regularity assumption on C is removed.) When a regular start set L and a regular control set C are given, the set C (L) is an ETOL language. In fact, this characterizes ETOL languages. Finally, it is shown that the set ∋(∑) of all possible homomorphisms (or the set C (∑) of all finite substitutions) from a given alphabet ∑ into itself cannot be a control set. In other words, neither of the semigroups ∋(∑) or C (∑) is finitely generated.

Grzegorz Rozenberg

Papers

Events and modules in reaction systems

Computing by communication in networks of membranes

Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars

TOL Schemes and Control Sets

Formal systems for gene assembly in ciliates