An extension of the taxonomy of persistent and nonviolent steps

DOI10.1016/j.ins.2017.01.037zbMath1429.68148OpenAlexW2585609504WikidataQ104379688 ScholiaQ104379688MaRDI QIDQ2293146

Maciej Koutny, Łukasz Mikulski, Marta Pietkiewicz-Koutny

Publication date: 7 February 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.01.037

zbMATH Keywords

persistencebehaviourPetri nettaxonomystructurestep semanticsnonviolencesingle-server execution semantics

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
• Unnamed Item
• Basic server semantics and performance monotonicity of continuous Petri nets
• On persistent reachability in Petri nets
• Synthesis and reengineering of persistent systems
• Marked directed graphs
• Synthesis of Live and Bounded Persistent Systems
• Persistent and Nonviolent Steps and the Design of GALS Systems
• Properties of Conflict-Free and Persistent Petri Nets
• Modelling, analysis and synthesis of asynchronous control circuits using Petri nets
• Logic Synthesis for Asynchronous Controllers and Interfaces
• Understanding Petri Nets
• Arbitration-free synchronization
• Deadlock-Freeness Analysis of Continuous Mono-T-Semiflow Petri Nets
• A Taxonomy of Persistent and Nonviolent Steps

This page was built for publication: An extension of the taxonomy of persistent and nonviolent steps