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

In the search for regulating mechanisms able to ensure computational universality for splicing systems and avoiding (some of the) non-realistic features of previous mechanisms of this type, we consider splicing systems with the splicing rules controlled by a next-rule mapping (like in programmed grammars). Then, this abstract model is "implemented" as a splicing system with the splicing rules themselves modified from a step to the next one by means of point mutations of the type one-symbol insertion/deletion.

https://ieeexplore.ieee.org/iel3/4619/12988/00592313.pdf

Computing by splicing: programmed and evolving splicing systems

Vector controlled concurrent systems. Part I: basic classes

Edge-label controlled graph grammars

We continue the study of the spiking neural P systems considered as transducers of binary strings or binary infinite sequences, and we investigate their ability to compute morphisms. The class of computed morphisms is rather restricted: length preserving or erasing, and the so-called 2-block morphisms can be computed; however, non-erasing non-length-preserving morphisms cannot be computed.

Computing morphisms by spiking neural p systems

A considerable part of formal language'theory deals with mappings on free monoids. A way to measure the similarity of mappings a,a on the free monoid r* generated by an alphabet E is to consider the equality language of a and a denoted by Eq(a,8) and consisting of all words x in E* such that a(x) = 6(x). To measure the similarity of a mapping with the identity mapping on the same domain one considers the fixed point language of a de~oted by Fp(a) and consisting of all words x in E such that a(x) = x (if a is a relation in r* x E* then we take Fp(a) = {x £ E* : x £ a(x)}). Thus equality languages and fixed point languages are very natural from the mathematical point of view. If we consider homomorphisms of free monoids then their equality languages represent sets of instances of the Post correspondence Problem; in this sense considering equality languages of homomorphisms is a classical topic in formal language theory (and computability theory). A revival of interest in those languages was stimulated recently by research concerning some very challenging decision problems in formal language theory; it became apparent that in several cases equality languages of homomorphisms playa vital role in (positive!) solutions of some basic equivalence problems of L systems (see e.g. (2) and [4]). This paper is an attempt towards a systematic investigation of equality languages and fixed point languages of homomorphisms and dgsm mappings (i.e. mappings defined by deterministic generalized sequential machines with accepting states). Homomorphisms and dgsm mappings are certainly among the most important mappings in formal language theory and so they form a good departure point for building up a systematic theory. Related work appears in [3] and [8]. In this extended abstract we summarize" some of the results we have obtained in this direction. It is organized as follows. Section 2 provides basic language-theoretic properties of equality languages and fixed point languages of homomorphisms. In Section 3 we present some results on the equality languages and fixed point languages of dgsm mappings but we concentrate on the subclass of dgsm mappings (that we introduce) called symmetric dgsm mappings. The theorem on fixed point languages of these mappings seems to be quite central in our theory. Then Section 4 provides an illustration of the usefulness of the classes of languages we have considered to provide various

Grzegorz Rozenberg

Papers

Computing by splicing: programmed and evolving splicing systems

Vector controlled concurrent systems. Part I: basic classes

Edge-label controlled graph grammars

Computing morphisms by spiking neural p systems

Equality languages, fixed point languages and representations of recursively enumerable languages