The home marking problem and some related concepts

Authors:
Roxana Melinte;Olivia Oanea;Ioana Olga;Ferucio Laurentiu Tiplea
Affiliations:
Faculty of Computer Science "Al. I. Cuza" University 6600 Iasi, Romania;Faculty of Computer Science "Al. I. Cuza" University 6600 Iasi, Romania;Faculty of Computer Science "Al. I. Cuza" University 6600 Iasi, Romania;Faculty of Computer Science "Al. I. Cuza" University 6600 Iasi, Romania
Venue:
Acta Cybernetica
Year:
2002

Citing 8
Cited 0

Petri nets: an introduction

Petri nets: an introduction
Confluent string rewriting

Confluent string rewriting
String-rewriting systems

String-rewriting systems
Free choice Petri nets

Free choice Petri nets
Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Liveness and Home States in Equal Conflict Systems

Proceedings of the 14th International Conference on Application and Theory of Petri Nets
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS

ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
DECIDABILITY QUESTIONS FOR PETRI NETS

DECIDABILITY QUESTIONS FOR PETRI NETS

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home marking problem for inhibitor Petri nets is undecidable. We relate then the existence of home markings to confluence and noetherianity and prove that confluent and noetherian Petri nets have an unique home marking. Finally, we define some versions of the state space inclusion problem related to the home marking and sub-marking problems, and discuss their decidability status.