Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90053-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999917306 / rank | |||
Normal rank | |||
Revision as of 01:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Problems concerning fairness and temporal logic for conflict-free Petri nets |
scientific article |
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
