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

The notion of a graph is a natural generalization of the notion of a string. Using one graph (the transition graph ofafinite automaton) one can define a language {the language of a given automaton). This well-known idea is generalized as follows: the notion of a hypergraph is a natural generalization of the notion of a graph. Using one hypergraph (equipped with an additional graph structure) one can define a graph language (a set ofgraphs). Several variants of graph grammars based on this idea are introduced in this paper together withformalism needed to investigate them and illustrating examples. The generating power of various graph-language-generating Systems is compared. Résumé. — La notion de graphe est une généralisation naturelle de la notion de mot. En utilisant un graphe {le graphe de transition d'un automate fini) on définit un langage {le langage accepté par l'automate). Cette idée est généralisée comme suit ; la notion de hypergraphe est une généralisation naturelle de la notion de graphe. Avec un hypergraphe (muni d'une structure de graphe supplémentaire) on peut définir un langage (un ensemble) de graphes. Dans cet article on introduit diverses variantes des grammaires de graphes basées sur cette idée; on donne le formalisme nécessaire pour les étudier, et on les illustre par des exemples. La puissance générative de divers systèmes engendrant des langages de graphes est comparée.

/pdf/hypergraph-systems-and-their-extensions-35latseqis.pdf

Hypergraph systems and their extensions

Cts systems and Petri nets

In this chapter we consider computing models based on two operations which were already considered in formal language theory, mainly with motivation from linguistics. These operations — insertion and deletion, with context dependence — can also be encountered in the genetic area and they can be performed, at least theoretically, in the following ways.

Insertion-Deletion Systems

The notion of a finite automaton is perhaps the most basic notion of formal language theory. Each finite automaton is (can be represented by) a graph and it defines the set of strings referred to as the languageof the automaton. Thus we have here the situation where one graph is used to define a (possibly infinite) set of strings. In other words, one 'higher type" object is used to define a set of "lower type" objects certainly in general graphs have a more involved structure than strings. In this paper we present an attempt to develop the same type of methodology for defining graph languages. A hypergraph (see, e.g. [B] ), is a structure generalizing the notion of a graph. We will discuss the use of one hypergraph to define a (possibly infinite) set of graphs. (Actually the structure we use is more general than a hypergraph it is a hypergraph equipped with an extra graph structure.) Various grain-generating systems based on the use of hypergraphs are introduced and their properties (included the properties of classes of languages they define) are discussed. We point out also the relationship of these systems to the theory of Petri nets. The paper presents only part of the results concerning the theory of hypergraph-based systems.

Grzegorz Rozenberg

Papers

Hypergraph systems and their extensions

Cts systems and Petri nets

Insertion-Deletion Systems

Hypergraph systems generating graph languages

Many-to-one simulation in E0L forms is decidable