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

Adding global forbidding context to context-free grammars

Grammatical constructions in selective substitution grammars.

Graph transformation through graph surfing in reaction systems

We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered trajectory-based operations can all be expressed in this formalism. It is shown that the generalized operations can simulate Turing machine computations. We consider the equivalence problem and a notion of unambiguity that is sufficient to make equivalence decidable for regular sets of trajectories under nonincreasing interpretations.

Interpreted Trajectories

Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system) An essential requirement for modeling such systems is the ability to express this kind of interaction Classical rule-based approaches like Petri nets and graph transformation are not suited for this purpose because they assume to have complete control about the state and its transformation Therefore, in this paper we propose a general framework which extends a given rule-based approach by a loose semantics where the rules of the system (eg, graph productions or Petri net transitions) are considered as incomplete descriptions of the transformations to be performed: they still determine the changes to the matched substructure but for the remaining part (the context) unspecified changes are possible representing the application of (unknown) rules from the environment

Grzegorz Rozenberg

Papers

Adding global forbidding context to context-free grammars

Grammatical constructions in selective substitution grammars.

Graph transformation through graph surfing in reaction systems

Interpreted Trajectories

Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information