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

Roughly speaking,DOS systems formalize the notion of generatively deterministic context free grammars. We explore the containment relationships among the class of languages generated byDOS systems and other subclasses of the class of context free languages. Leaving the axiom of aDOS system unspecified yields aDOS scheme, which defines a mapping from words to languages over a given alphabet. We explore the algebraic properties ofDOS mappings and obtain an algebraic characterization of a fundamental subclass of theDOS mappings generated byDOS schemes which are propagating (non erasing) and have no cycles of derivability among letters of the alphabet. We apply this characterization to show that the mapping equivalence problem for propagatingDOS schemes is decidable.

On dos languages and dos mappings

On ET0L Systems with rank

All classes of grammars investigated in formal language theory generate a language by starting from nite sets of axioms and iteratively applying certain production rules which transform \correct" strings into \correct" strings. If the set of rules is xed and the axiom set is varying over the family of nite languages, then to any grammar we associate a family of languages. When using grammars of certain type X, we call this family an X-family. The aim of this paper is to propose the investigation of such families of languages. We only formulate here some of the basic problems and we start the study of M-families, those obtained when using Marcus contextual grammars as starting point. Several properties of M-families are given, examples and counterexamples are produced, and some decidability results are proven.

Grzegorz Rozenberg

Papers

On dos languages and dos mappings

On ET0L Systems with rank

X-Families: An Approach to the Study of Families of Syntactically Similar Languages

Gene assembly in ciliates: computing by folding and recombination

On ambiguity in E0L systems