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

An old-fashioned recipe for real time.- Verifying automata specifications of probabilistic real-time systems.- The theory of timed automata.- Logics and models of real time: A survey.- The state operator in real time process algebra.- Timed process algebras with urgent interactions and a unique powerful binary operator.- Time in state based formal description techniques for distributed systems.- Real-time and the Mu-Calculus (preliminary report).- Implementing reactive programs on circuits a hardware implementation of LUSTRE.- Semantics and completeness of Duration Calculus.- Timed transition systems.- Compositional verification of real-time systems using extended Hoare triples.- Semantics of reactive systems in abstract time.- Problems, promises and performance: some questions for real-time system specification.- Abstraction in real time process algebra.- (Real) time: A philosophical perspective.- Specification and analysis of resource-bound real-time systems.- Forward and backward simulations for timing-based systems.- Prom timed to hybrid systems.- Coping with implementation dependencies in real-time system verification.- Validating real-time systems by executing logic specifications.- An overview and synthesis on timed process algebras.- From ATP to timed graphs and hybrid systems.- Verification of safety critical systems using TTM/RTTL.- Predicative specification of timed processes.- Putting time into proof outlines.- Timed CSP: Theory and practice.- A specification of the cat and mouse problem.- Layering and action refinement for timed systems.

Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings

Graph-grammars and their application to computer science : 2nd international workshop, Haus Ohrbeck, Germany, October 4 - 8, 1982

Over the last decade there has been a shift from “data-aware” information systems to “process-aware” information systems. To support business processes an enterprise information system needs to be aware of these processes and their organizational context. Business Process Management (BPM) includes methods, techniques, and tools to support the design, enactment, management, and analysis of such operational business processes. BPM can be considered as an extension of classical Workflow Management (WFM) systems and approaches. This tutorial introduces models, systems, and standards for the design, analysis, and enactment of workflow processes. Petri nets are used for the modeling and analysis of workflows. Using Petri nets as a formal basis, contemporary systems, languages, and standards for BPM and WFM are discussed. Although it is clear that Petri nets can serve as a solid foundation for BPM/WFM technology, in reality systems, languages, and standards are developed in an ad-hoc fashion. To illustrate this XPDL, the “Lingua Franca” proposed by the Workflow Management Coalition (WfMC), is analyzed using a set of 20 basic workflow patterns. This analysis exposes some of the typical semantic problems restricting the application of BPM/WFM technology.

Lectures on Concurrency and Petri Nets

Petri Nets: Central Models and Their Properties

The notion of a labeled partial 2-structure is introduced and studied It generalizes the notion of a (labeled) 2-structure studied in [1] and [2] and it provides a convenient mathematical framework for studying graphs In particular, a subclass of labeled partial 2-structures, the so-called labeled partial set 2-structures corresponds very closely to those graphs that are state spaces of concurrent systems Part I of this paper investigates the basic theory of labeled partial 2-structures and it considers the problem of representing partial 2-structures as partial set 2-structures

Grzegorz Rozenberg

Papers

Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings

Graph-grammars and their application to computer science : 2nd international workshop, Haus Ohrbeck, Germany, October 4 - 8, 1982

Lectures on Concurrency and Petri Nets

Petri Nets: Central Models and Their Properties

Partial (set) 2-structures. Part I: basic notions and the representation problem