Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4102499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Problems concerning fairness and temporal logic for conflict-free Petri nets |
scientific article; zbMATH DE number 4102499 |
Statements
Problems concerning fairness and temporal logic for conflict-free Petri nets (English)
0 references
1989
0 references
This paper is identical to the author's work [Advances in Petri Nets, Lect. Notes Comput. Sci. 340, 200-226 (1988)] except for the improvement of Section 4 about model checking. The complexity of the fair nontermination problem is studied for conflict-free Petri nets under several definitions of fairness. The question of determining whether a given structure defines a model of a specification expressed in temporal logic is proved to be undecidable for conflict-free Petri nets. Even if the logic is severely restricted, it is still not feasible: although it becomes decidable, it is then NP-complete.
0 references
conflict-free Petri nets
0 references
fairness property
0 references
model checking
0 references
complexity
0 references
temporal logic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.95887196
0 references
0.8959745
0 references
0.8891436
0 references
0.8801067
0 references
0 references
