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

— Counting languages are the languages of the form {axa\\.. .a n t\\ t^2, n^ 1} where au ..., atare letters no two consécutive ofwhich are identical. They possess a \"clean structure\" in the sensé that if an arbitrary wordfrom such a language is eut in t subwords ofequal length then no two consécutive subwords contain an occurrence of the same letter, It is shown that whenever an FPOL system G is such that Us language contains a \"dense enough\" subset of a counting language then the whole language ofG cannot have such a clean structure. Résumé. — Les langages « comptants » sont les langages de la forme { a\" a\\. . . a\" \\t ^ 2, n ̂ 1} , où au ..., at sont des lettres, et deux lettres consécutives étant différentes. Ils possèdent une « bonne structure », en ce sens que si un mot quelconque d'un tel langage est divisé en t facteurs de même longueur, alors deux facteurs consécutifs ne contiennent pas d'occurrence d'une même lettre. On montre que, si un System FPOL G est tel que son langage contient un sous-ensemble d'un langage comptant qui est « assez dense » alors le langage de G complet ne peut pas avoir cette « bonne structure ».

/pdf/fpol-systems-generating-counting-languages-2j0u8k8eh0.pdf

FPOL systems generating counting languages

We introduce terminally coded (TC) grammars, which generalize parenthesis grammars in the sense that from each word ω generated by a TC grammar we can recover the unlabeled tree t underlying its derivation tree(s). More precisely, there is a length-preserving homomorphism that maps ω to an encoding of t. Basic properties of TC grammars are established. For backwards deterministic TC grammars we give a shift-reduce precedence parsing method without look-ahead, which implies that TC languages can be recognized in linear time. The class of TC languages contains all parenthesis languages, and is contained in the classes of simple precedence languages and NTS languages.

Grammatical Codes Of Trees And Terminally Coded Grammars

This paper presents a formal framework for investigating processes driven
by interactions between biochemical reactions in living cells. These interactions are based on the mechanisms of facilitation and inhibition, which underlie the definition of reaction systems - the central construct of our framework. We discuss in this paper the basic setup for reaction systems, and its motivation. We also present an important extension of reaction systems as well as some research topics and results.

/pdf/reaction-systems-a-formal-framework-for-processes-based-on-2kt5yu5o01.pdf

Reaction Systems: a Formal Framework for Processes Based on Biochemical Interactions

Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers

We introduce F-structures and investigate interpretations of trees in F-structures. Thus trees are viewed as schemes of computations in F-structures. Every tree is shown to be strongly equivalent to some chain-free tree. This enables us to use the grammatical codings of [2] to define formulas for arbitrary interpreted trees. We also introduce a syntactic way to compute the values of interpreted trees.

Grzegorz Rozenberg

Papers

FPOL systems generating counting languages

Grammatical Codes Of Trees And Terminally Coded Grammars

Reaction Systems: a Formal Framework for Processes Based on Biochemical Interactions

Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers

Semantics of trees