Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs
From MaRDI portal
Publication:2947214
DOI10.1007/978-3-319-21145-9_7zbMath1321.68364OpenAlexW970977805MaRDI QIDQ2947214
Publication date: 22 September 2015
Published in: Graph Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21145-9_7
category of partially ordered setsinhibitor arcsreconfigurable Petri nets\(\mathcal {M}\)-adhesive transformation systemtransition priorities
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Cites Work
- Construction and properties of adhesive and weak adhesive high-level replacement categories
- Petri net semantics of priority systems
- Analysis issues in Petri nets with inhibitor arcs
- Graph transformation for specification and programming
- Fundamentals of algebraic graph transformation
- Semantics of inhibitor nets
- Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories
- Undecidable Control Conditions in Graph Transformation Units
- ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence
- Graph Transformation Units – An Overview
- Transformations in Reconfigurable Place/Transition Systems
- Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems
- Adhesive and quasiadhesive categories
- Lectures on Concurrency and Petri Nets
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Unnamed Item
- Unnamed Item
