A taxonomy of fairness and temporal logic problems for Petri nets (Q805257): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127436291, #quickstatements; #temporary_batch_1724809781087 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90228-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053421425 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127436291 / rank | |||
Normal rank | |||
Latest revision as of 02:52, 28 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A taxonomy of fairness and temporal logic problems for Petri nets |
scientific article |
Statements
A taxonomy of fairness and temporal logic problems for Petri nets (English)
0 references
1991
0 references
A temporal logic for reasoning about Petri nets is defined, extending the ideas from \textit{R. R. Howell} and \textit{L. E. Rosier} [Theor. Comput. Sci. 64, No.3, 305-329 (1989; Zbl 0673.68040)]. The paper is also strongly related to the ideas from \textit{R. R. Howell}, \textit{L. E. Rosier} and \textit{Hsu-Chun Yen} [Theor. Comput. Sci. 80, No.1, 77-104 (1991; to appear)]. It is shown that the model checking problem for the temporal logic for reasoning about Petri nets is PTIME-equivalent to the Petri net reachability problem.
0 references
fairness
0 references
temporal logic
0 references
Petri nets
0 references
model checking
0 references
0 references
0 references
