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

Two normal form theorems for contextual grammars with regular choice are given. The first one concerns the (dyna­ mic) use of productions in derivations when a contextual grammar is executed in the external mode. The second one concerns the (static) relationships between the productions and so it applies to both the external and the internal execution of contextual gram­ mars. Using the first normal form, a new (more elegant) proof of the linearity of the external languages of contextual grammars with regular choice is given.

Normal forms for contextual grammars

A word is called square-free if it does not contain a subword of the form αα where α is a nonempty word. A language is called square-free if it consists of square-free words only. The subword complexity of a language K, denoted πK, is a function of positive integers which for a positive integer n assigns the number of different subwords of lenght n occurring in words of K. It is known that if a DOL language K is square-free then, for all n, πK(n) ≤ r n log2 for some positive integer r. We demonstrate that there exists a square-free DOL language K on four letters such that, for all n, πK(n) ≥ r n log2 for some positive real p. This turns out to be the best lower bound on the size of the alphabet needed for a square-free DOL language to have the number of subwords of order nlognn

On the size of the alphabet and the subword complexity of square-free DOI languages

On the (Combinatorial) Structure of L Languages without Interactions

Invited address.- Some personal views of net theory.- List of contributions.- Structural transformations giving B-equivalent PT-nets.- Equivalence notions for concurrent systems.- Milner's communicating systems and Petri nets.- A matrix-based implementation of generalized Petri nets.- Petri nets specification of virtual ring protocols.- A note on D-continuous causal nets.- S-invariance in predicate/transition nets.- A diagram editor for line drawings with inscriptions.- Formal semantics by a combination of denotational semantics and high-level Petri nets.- Notions of computability by Petri nets.- High-level Petri nets.- Specification and verification of networks in a Petri net based language.- Construction of distributed systems from cycle-free finite automata.- A graph theoretical property for minimal deadlocks.- Petri nets with individual tokens.- Subset languages of Petri nets.- Control of flexible production systems and Petri nets.- On the notion of interface in condition/event-systems.- Behavioral equivalence of concurrent systems.- Program of the workshop.- Addresses of contributors.

Applications and theory of Petri nets : selected papers from the 3rd European Workshop on Applications and Theory of Petri Nets, Varenna, Italy, September 27-30, 1982

Grzegorz Rozenberg

Papers

Normal forms for contextual grammars

On the size of the alphabet and the subword complexity of square-free DOI languages

On the (Combinatorial) Structure of L Languages without Interactions

Applications and theory of Petri nets : selected papers from the 3rd European Workshop on Applications and Theory of Petri Nets, Varenna, Italy, September 27-30, 1982

Membrane Computing - 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised Selected Papers