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 this paper we provide a short overview of the mathematical theory of L systems. Because of the limitations on the size of this paper the overview is very concise and it treats only the small fragment of the existing theory (the choice of the material covered strongly reflects the personal point of view of the author). Still it is hoped that the reader will get an idea what are the L systems about and may be some of the readers will join the research in this interesting and very promising area.

L Systems, Sequences and Languages

1 Dept. of Mathematics, University of Turku, FIN-20014 Turku, Finland. 2 Dept. of Computer Science, Åbo Akademi University, FIN-20520 Turku, Finland. 3 Leiden Institute for Advanced Computer Science, Leiden University Niels Bohrweg 1, 2333 CA Leiden, The Netherlands and Department of Computer Science, University of Colorado, Boulder, Co 80309-0347, USA. emails: harju@utu.fi, ipetre@abo.fi, rozenber@liacs.nl

Gene Assembly in Ciliates Part I. Molecular Operations.

On Some Context Free Languages Which Are Not ETOL Languages ; CU-CS-048-74

Arrow logic with arbitrary intersections : applications to Pawlak's information systems p. 1 Rough set approach to behavioral pattern identification p. 27 Multiset-based self-assembly of graphs p. 49 Entropies and co-entropies of coverings with application to incomplete information systems p. 77 Rough sets and learning by unification p. 107 Rough dialogue and implication lattices p. 123 On string languages generated by spiking neural P systems p. 141 Relative nondeterministic information logic is EXPTIME-complete p. 163 A correspondence framework between three-valued logics and similarity-based approximate reasoning p. 179 A possibility-theoretic view of formal concept analysis p. 195 A multi-modal logic for disagreement and exhaustiveness p. 215 Complexity issues in multiagent logics p. 239 Reaction systems p. 263 Cooperative world modeling in dynamic multi-robot environments p. 281 Towards a pragmatic mereology p. 295 Pawlak's information systems in terms of Galois connections and functional dependencies p. 315 Z. Pawlak, a precursor of DNA computing and of picture grammars p. 331 Locally derivable graphs p. 335 On construction of partial reducts and irreducible partial decision rules p. 357 Retracts of algebras p. 375 Bridging the gap between non-symbolic and symbolic processing-how could human being acquire language? p. 385 Near sets : special theory about nearness of objects p. 407 Concept approximation in mathematics and computer science. An essay in homage to Zdzislaw Pawlak p. 435 Approaches to conflict dynamics based on rough sets p. 453 Subword balance in binary words, languages and sequences p. 469 Histogram thresholding using beam theory and ambiguity measures p. 483 On generating all binary trees p. 505

In Memory of Professor Zdzislaw Pawlak.

A basic problem in the area of combinatorial algorithms for genome evolution is to determine the minimum number of large scale evolutionary events (genome rearrangements) that transform a genome into another. The present paper is a contribution to the algorithmic study of genom evolution by crossovers (translocations). Crossover is the biological process of exchanging material of the end of two (homologous) chromosomes \cite{hfs}. In this paper we consider chromosomes as being linear strings that exchange each other prefixes in the crossover process. Two types of crossover distance between two sets of strings (genomes) are introduced; we examine the complexity of computing these distances in the case of uniform crossover, that is at each step the strings exchange prefixes of the same length. We present exact polynomial algorithms based on the "greedy" strategy when the target set is a singleton. When considering arbitrary target sets an 2-approximation algorithm is provided for computing the sequential crossover distance. Some open problems are also formulated.

Grzegorz Rozenberg

Papers

L Systems, Sequences and Languages

Gene Assembly in Ciliates Part I. Molecular Operations.

On Some Context Free Languages Which Are Not ETOL Languages ; CU-CS-048-74

In Memory of Professor Zdzislaw Pawlak.

On the Crossover Distance