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

/pdf/on-the-generalized-post-correspondence-problem-with-lists-of-17jd1ffq3e.pdf

On the (Generalized) Post Correspondence Problem with Lists of Length 2

Un texte est considere comme un procede de loi. Les proprietes combinatoires de tels procedes de loi sont etudies. On donne en particulier des caracterisations combinatoires de textes alternants. On introduit egalement une sur-classe naturelle des textes alternants (appeles les textes sans saut) et on les caracterise tant par des proprietes combinatoires que par des proprietes de cloture

/pdf/combinatorial-properties-of-texts-y5tqj9ie7w.pdf

Combinatorial properties of texts

Graph Transformation.- On the Concurrent Semantics of Algebraic Graph Grammars.- From Graph Transformation to Software Engineering and Back.- Flexible Interconnection of Graph Transformation Modules.- Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation.- Graph Processes with Fusions: Concurrency by Colimits, Again.- Graph Transformation with Variables.- Graph Transformation in Molecular Biology.- Changing Labels in the Double-Pushout Approach Can Be Treated Categorically.- Algebraic Specification and Logic.- Modules, Brains and Schemas.- From Conditional Specifications to Interaction Charts.- Algebraic Properties of Interfaces.- ? T -Integration of Logics.- Functorial Semantics of Rewrite Theories.- Expander2.- Relationships Between Equational and Inductive Data Types.- Cofree Coalgebras for Signature Morphisms.- Formal and Visual Modeling.- Nested Constraints and Application Conditions for High-Level Structures.- Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements.- Main Concepts of Networks of Transformation Units with Interlinking Semantics.- Embeddings and Contexts for Link Graphs.- Towards Architectural Connectors for UML.- Loose Semantics of Petri Nets.- A Formal Framework for the Development of Concurrent Object-Based Systems.- A Formal Description of the Basic Concepts of System Theory for Transportation.

Formal Methods in Software and Systems Modeling: essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday

The model of Elementary Transition Systems has been introduced by the authors as an abstraction of Elementary Net Systems - with a formal embedding in terms of a categorical coreflection, keeping behavioural information like causality, concurrency and conflict, but forgetting the concrete programming of a particular behaviour over an event set using conditions. In this paper we give one example of the advantages of ETS over ENS, - the definition of local state refinement. We show that the well known problems in understanding within nets the simple notion of syntactic substitution of conditions by (sub) nets behaviourally, - these problems seem to disappear when moving to the more abstract level of ETS. Formally, we show that the ETS-version of condition-substitution does satisfy nice and natural properties, e.g., projection and compositionality results w.r.t. a standard notion of transition system morphisms.

/pdf/elementary-transition-systems-and-refinement-sqezcodp1k.pdf

Grzegorz Rozenberg

Papers

On the (Generalized) Post Correspondence Problem with Lists of Length 2

Combinatorial properties of texts

Formal Methods in Software and Systems Modeling: essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday

Elementary Transition Systems and Refinement

On Strongly Context-Free Languages