Decidability of a temporal logic problem for Petri nets (Q914407): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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(90)90006-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964087553 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3766865 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordering by Divisibility in Abstract Algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3802633 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4732129 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank | |||
Normal rank | |||
Latest revision as of 15:46, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidability of a temporal logic problem for Petri nets |
scientific article |
Statements
Decidability of a temporal logic problem for Petri nets (English)
0 references
1990
0 references
parallel systems
0 references
fairness
0 references
place/transition Petri nets
0 references
