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

DNA computing, or more generally molecular computing, is an exciting research area at the intersection of mathematics, computer science and molecular biology. Research in DNA computing can be roughly divided in two streams: DNA computing in vitro and in vivo. The former is concerned with building (specialized) DNA-based computers in test tubes, while the latter is concerned with implementing some computational components in living cells, as well as with studying the computational processes taking place in the living cells.

Tutorial on DNA Computing and Graph Transformation

Generalizing Cook's transformation to imperative stack programs- A rewriting of Fife's theorem about overlap-free words- Reconsidering the jeep problem or how to transport a birthday present to Salosauna- Learning picture sets from examples- Randomness as an invariant for number representations- Cooperating grammars' systems: Power and parameters- Parallel pattern generation with one-way communications- Dynamic labeled 2-structures with variable domains- Deciding the NTS property of context-free grammars- Homomorphic representations by products of tree automata- Identities and transductions- Decomposition of infinite labeled 2-structures- An iteration property of Lindenmayerian power series- Comparing descriptional and computational complexity of infinite words- On some open problems concerning the complexity of cellular arrays- Power of controlled insertion and deletion- From colonies to eco(grammar)systems- On the multiplicity equivalence problem for context-free grammars- On general solution of word equations- On (left) partial shuffle- Learning theoretical aspects is important but (Sometimes) dangerous- Bisimulation, games, and logic- Cryptographic protocols and voting- Cryptographic protocols for auctions and bargaining- On the size of components of cooperating grammar systems- An elementary algorithmic problem from an advanced standpoint- Event detection for ODES and nonrecursive hierarchies- Rediscovering pushdown machines- String matching algorithms and automata- Classifying regular languages by their syntactic algebras- On polynomial matrix equations XT=p(X) and X=p(X) Where all parameters are nonnegative- Gram's equation - A probabilistic proof

Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa Graz, Austria, June 10-11, 1994 : Proceedings

The gene assembly process that transforms the micronuclear genome to the macronuclear genome in stichotrichs ciliates is a complex DNA processing which is very interesting from the computational point of view. We shall give a survey of the notions and results concerning three molecular operations, known as ld, hi, and dlad, that have been postulated to accomplish the gene assembly process. These operations are modelled on three abstraction levels: MDS descriptors, legal strings, and overlap graphs. It turns out that these three abstractions are equivalent as far as the operational modelling of gene assembly is concerned.

Modelling Gene Assembly in Ciliates

Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science

For a finite set D of nodes let E2(D)={(x, y)mx, y∈D, x≠y}. We define an inversive Δ2-structure g as a function gE2(D)→Δ into a given group Δ satisfying the property g(x, y)=g(y, x)−1 for all (x, y)∈E2(D). For each function (selector) σD→Δ there is a corresponding inversive Δ2-structure gσ defined by gσ(x, y)=σ(x)·g(x, y)·σ(y)−1. A function η mapping each g into the group Δ is called an invariant if η(gσ)=η(g) for all g and σ. We study the group of free invariants η of inversive Δ2-structures, where η is defined by a word from the free monoid with involution generated by the set E 2(D). In particular, if Δ is abelian, the group of free invariants is generated by triangle words of the form (x0, x1)(x1, x2)(x2, x0).

/pdf/invariants-of-inversive-2-structures-on-groups-of-labels-fb869v4csr.pdf

Grzegorz Rozenberg

Papers

Tutorial on DNA Computing and Graph Transformation

Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa Graz, Austria, June 10-11, 1994 : Proceedings

Modelling Gene Assembly in Ciliates

Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science

Invariants of inversive 2-structures on groups of labels