Synthesis of Petri Nets with Whole-Place Operations and Localities

DOI10.1007/978-3-319-46750-4_7zbMath1422.68171OpenAlexW2521801375MaRDI QIDQ3179395

Marta Pietkiewicz-Koutny, Maciej Koutny, H. C. M. Kleijn

Publication date: 21 December 2016

Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=230191/0E69ABF5-E62D-43FE-8A39-6A388C14BFDA.pdf&pub_id=230191

zbMATH Keywords

localityPetri netconcurrencytransition systemsynthesis problemtheory of regionsstep semanticswhole-place operations net

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applying regions
• Petri net synthesis
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Elementary transition systems
• A well-structured framework for analysing Petri net extensions
• The synthesis problem of Petri nets
• Synthesis Problem for Petri Nets with Localities
• A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Flip-flop nets
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Synthesis of Nets with Step Firing Policies

This page was built for publication: Synthesis of Petri Nets with Whole-Place Operations and Localities