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

We continue the formal study of multiset-based self-assembly. The process of self-assembly of graphs, where iteratively new nodes are attached to a given graph, is guided by rules operating on nodes labelled by multisets. In this way, the multisets and rules model connection points (such as "sticky ends") and complementarity/affinity between connection points, respectively. We identify three natural ways (individual, free, and collective) to attach (aggregate) new nodes to the graph, and study the generative power of the corresponding self-assembly systems. For example, it turns out that individual aggregation can be simulated by free or collective aggregation. However, we demonstrate that, for a fixed set of connection points, collective aggregation is rather restrictive. We also give a number of results that are independent of the way that aggregation is performed.

On aggregation in multiset-based self-assembly of graphs

We introduce and investigate some shuffle-like operations on ω-words and ω-languages. The approach is applicable to concurrency, providing a method to define the parallel composition of processes. It is also applicable to parallel computation. The operations are introduced using a uniform method based on the notion of an ω-trajectory. As a consequence, we obtain a very intuitive geometrical interpretation of the parallel composition operation. Our main results concern associativity. A rather surprising interconnection between associativity and periodicity will be exhibited.

Shuffle-like operations on ω-words

The notion ofanEOLformcombinedwith pure interprétations is studied. Thisapproach is compared and contrasted with the original approach of an EOLform with its interprétations. In particular it is shown there are no pure very complete EOL farms. Résumé. — On étudie la notion déforme EOL avec interprétation pure. Cette approche se distingue de V approche originale d'une f orme EOL avec ses interprétations. On montre en particulier qu'il n'existe pas déformes EOL pures très complètes.

/pdf/pure-interpretations-of-eol-forms-56ggu1rlru.pdf

Pure interpretations of EOL forms

Given a rewriting system G consisting of an alphabet V, the set of productions P and the axiom ω, the most natural set of strings associated with G is the set of all strings one can “derive in G” starting with ω and using productions from P. Now, one can define “the language of G” in at least two different ways.

Grzegorz Rozenberg

Papers

On aggregation in multiset-based self-assembly of graphs

Shuffle-like operations on ω-words

Pure interpretations of EOL forms

Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems

Basic formulas and languages: PART II.Applications to E0L systems and forms