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

Permutations, parenthesis words, and Schro¨der numbers

Firstly, net theory, which is a well established theory of distributed systems and processes [I] relies heavily on a graphical notation. One of the strengths of this theory is that many of the fundamental notions concerning concurrent systems and in particular, the dynamics of a concurrent systemcan be made transparent with the help of simple net diagrams and transformations of such diagrams. It is important to provide a solid formal foundation to this aspect of net theory and graph grammars appear to be the obvious tool for doing so. The second motivation is that in the study of concurrency problems that arise within the area of graph grammars [2] we think it is possible and fruitful to apply the concepts and techniques of net theory.

Petri nets and their relation to graph grammars

We consider a class of Petri nets suitable for the modelling and behavioural analysis of globally asynchronous locally synchronous (GALS) systems. The proposed model of PTL-nets is basically that of Place/Transition-nets (PT-nets) equipped with an explicit notion of locality. Each locality identifies a distinct set of transitions which may only be executed synchronously, i.e. in a maximally concurrent manner. We investigate how to capture the non-sequential semantics of PTL-nets using techniques similar to those used in the standard treatment of PT-nets. As a result, we postulate that processes based on occurrence nets augmented with additional information about localities and enabledness of non-fired transitions can provide a satisfactory basis for a causality semantics of PTL-nets. Abstract We consider a class of Petri nets suitable for the modelling and behavioural analysis of globally asynchronous locally synchronous (GALS) systems. The proposed model of PTL-nets is basically that of Place/Transition-nets (PT-nets) equipped with an explicit notion of locality. Each locality identifies a distinct set of transitions which may only be executed synchronously, i.e. in a maximally concurrent manner. We investigate how to capture the non-sequential semantics of PTL-nets using techniques similar to those used in the standard treatment of PT-nets. As a result, we postulate that processes based on occurrence nets augmented with additional information about localities and enabledness of non-fired transitions can provide a satisfactory basis for a causality semantics of PTL-nets. Abstract. We consider a class of Petri nets suitable for the modelling and behavioural analysis of globally asynchronous locally synchronous (GALS) systems. The proposed model of PTL-nets is basically that of Place/Transition-nets (PT-nets) equipped with an explicit notion of locality. Each locality identifies a distinct set of transitions which may only be executed synchronously, i.e., in a maximally concurrent manner. We investigate how to capture the non-sequential semantics of PTL-nets using techniques similar to those used in the standard treatment of PT-nets. As a result, we postulate that processes based on occurrence nets augmented with additional information about localities and enabledness of non-fired transitions can provide a satisfactory basis for a causality semantics of PTL-nets.

https://eprints.ncl.ac.uk/file_store/production/160903/4805E527-2218-4FCB-A3D9-0FBC4DE5B1BD.pdf

Processes of Petri Nets with Localities

The complexity of regular DNLC graph languages

Part 1 Computational geometry, H. Edelsbrunner et al. Part 2 Algebraic specification, H. Ehrig et al: on the potential role of algebraic specification within computer science, H. Ehrig and P. Pepper linking schemas and module specifications - a proposal, H. Ehrig and M.A. Arbib a short Oxford survey of order sorted algebra, J. Goguen and R. Diaconescu. Part 3 Logic in comptuer science, Y. Gurevich et al: on Kolmogorov machines and related issues Topoi and computation, A. Blass. Part 4 Structural complexity, J. Hartmanis et al Goedel, von Neumann and the P=? NP problem counting hierarchies - polynomial time and constant depth circuits, E.W. Allender and K.W. Wagner. Part 5 Formal language theory, A. Salomaa et al decidability in finite automata parallel communicating grammar systems, L. Santean. (Part contents).

Grzegorz Rozenberg

Papers

Permutations, parenthesis words, and Schro¨der numbers

Petri nets and their relation to graph grammars

Processes of Petri Nets with Localities

The complexity of regular DNLC graph languages

Current trends in theoretical computer science : essays and tutorials