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 computational model of membrane computing (formalized through membrane systems, also called P systems) is based on the way that biological membranes define compartments, each having its set of molecules and (enzymes enhancing) reactions, with compartments communicating through the transport of molecules through membranes. In this paper we augment the basic model of membrane systems with promoters and inhibitors, which formalize the reaction enhancing and reaction prohibiting roles of various substances (molecules) present in cells. We formalize such membrane systems with promoters/inhibitors and investigate their basic properties. In particular we establish universality results, i.e., we provide characterizations of recursively enumerable sets (of vectors of natural numbers) using these systems. It turns out that systems with promoters/inhibitors achieve universal computations without using the standard “auxiliary” features of membrane systems, for instance, without using catalysts.

Membrane systems with promoters/inhibitors

Vol 1: Algorithms Computational Complexity Distributed Computing Natural Computing Vol 2: Formal Specification Logic in Computer Science Concurrency Formal Language Theory

Current Trends in Theoretical Computer Science: The Challenge of the New Century

A new language generating mechanism is defined. It is derived from a generalization of the two-level substitution mechanism and involves several (incomplete) grammars which communicate with each other by introducing variables for which they have no productions themselves. When the grammars are context-free, this yields an alternative definition for the context-free programmed grammars. When the grammars are EOL (parallel) a class is found lying (strictly ?) between ETOL and CFP.

Cooperating grammar systems

Elementary homomorphisms and a solution of the D0L sequence equivalence problem

This paper introduces a new family of languages which originated from a study of some mathematical models for the development of biological organisms. Various properties of this family are established and in particular it is proved that it forms a full abstract family of languages. It is compared with some other families of languages which have already been studied and which either originated from the study of models for biological development or belong to the now standard Chomsky hierarchy. A characterization theorem for context-free languages is also established.

Grzegorz Rozenberg

Papers

Membrane systems with promoters/inhibitors

Current Trends in Theoretical Computer Science: The Challenge of the New Century

Cooperating grammar systems

Elementary homomorphisms and a solution of the D0L sequence equivalence problem

Extension of tabled 0L-systems and languages