On the well-foundedness of adequate orders used for construction of complete unfolding prefixes (Q2380011): 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/j.ipl.2007.06.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013854757 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Branching processes of Petri nets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improvement of McMillan's unfolding algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordering by Divisibility in Abstract Algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Canonical prefixes of Petri net unfoldings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An intuitionistic proof of Kruskal's theorem / rank | |||
Normal rank | |||
Latest revision as of 14:25, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the well-foundedness of adequate orders used for construction of complete unfolding prefixes |
scientific article |
Statements
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes (English)
0 references
24 March 2010
0 references
adequate order
0 references
unfolding prefix
0 references
Petri net
0 references
well-foundedness
0 references
concurrency
0 references
