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

Automated synthesis from behavioural specifications is an attractive and powerful way of constructing concurrent systems. Here we focus on the problem of synthesising a membrane system from a behavioural specification given in the form of a transition system which specifies the desired state space of the system to be constructed. We demonstrate how a Petri net solution to this problem, based on the notion of region of a transition system, yields a method of automated synthesis of membrane systems from state spaces.

Membrane Systems and Petri Net Synthesis

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Extending the Notion of Finite Index

We describe a formal language/notation for DNA molecules that may contain nicks and gaps. The elements of the language, DNA expressions, denote formal DNA molecules. Different DNA expressions may denote the same formal DNA molecule. We analyse the shortest DNA expressions denoting a given formal DNA molecule. We determine lower bounds on their lengths and explain how we construct these minimal DNA expressions.

https://liacs.leidenuniv.nl/~vlietrvan1/dnaexpressions/natcompVVHRfinal.pdf

The Construction of Minimal DNA Expressions

Ordinary interpretations of EOL forms permit the omission of productions and the replacement of different occurrences of the same symbol in a production by different symbols. This drastically weakens the relation between the structure of an interpretation and its underlying EOL form. We claim that by using the notion of X -uniformity and cc -interpretation this drawback can be overcome.

Grzegorz Rozenberg

Papers

Membrane Systems and Petri Net Synthesis

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Extending the Notion of Finite Index

The Construction of Minimal DNA Expressions

Increasing the similarity of EOL form interpretations