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

Fixed point languages and equality languages of homomorphisms and dgsm mappings are consid- ered. Some basic properties of these classes of languages are proved, and it is shown how to use them to represent recursively enumerable sets. In particular, very simple languages are introduced which play the same role for the class of recursively enumerable languages that the Dyck languages play for the class of context-free languages. Finally, a new type of acceptor for defining equality languages is introduced. KEY WOADS AND PHRASES: equality language, fLxed point language, recursively enumerable language, determin- istic sequential machine, Turing machine, Post correspondence problem, shuffle, AFL generator, representation of languages

/pdf/fixed-point-languages-equality-languages-and-representation-3sjrs395jq.pdf

Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Elementary Net Systems

Graph grammars with neighbourhood-controlled embedding

The theory of 2-structures provides a convenient framework for decomposition and transformation of mathematical systems where one or several different binary relationships hold between the objects of the system. In particular, it forms a useful framework for decomposition and transformation of graphs.The decomposition methods presented in this book correspond closely to the top-down design methods studied in computer science. The transformation methods considered here have a natural interpretation in the dynamic evolution of certain kinds of communication networks. From the mathematical point of view, the clan decomposition method presented here, also known as modular decomposition or substitution decomposition, is closely related to the decomposition by quotients in algebra. The transformation method presented here is based on labelled 2-structures over groups, the theory of which generalizes the well-studied theory of switching classes of graphs.This book is both a text and a monograph. As a monograph, the results concerning the decomposition and transformation of 2-structures are presented in a unified way. In addition, detailed notes on references are provided at the end of each chapter. These notes allow the reader to trace the origin of many notions and results, and to browse through the literature in order to extend the material presented in the book.To facilitate its use as a textbook, there are numerous examples and exercises which provide an opportunity for the reader to check his or her understanding of the discussed material. Furthermore, the text begins with preliminaries on partial orders, semigroups, groups and graphs to the extent needed for the book.

The Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs

Ciliates, a very ancient group of organisms, have evolved extraordinary ways of organizing, manipulating, and replicating the DNA in their micronuclear genomes. The way that ciliates transform genes from their micronuclear (storage) form into their macronuclear (expression) form constitutes a very interesting case of “DNA computing in vivo”. In this paper we investigate in detail one aspect of this transformation, viz., gene (un)scrambling. In particular, we use the formal framework of pointer reduction systems to investigate the computational aspects of gene (un)scrambling.

Grzegorz Rozenberg

Papers

Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Elementary Net Systems

Graph grammars with neighbourhood-controlled embedding

The Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs

Computational Aspects of Gene (Un)Scrambling in Ciliates