An efficient characterization of Petri net solvable binary words (Q2280188): 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.1007/978-3-319-91268-4_11 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2801591860 / rank | |||
Normal rank | |||
Revision as of 01:07, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient characterization of Petri net solvable binary words |
scientific article |
Statements
An efficient characterization of Petri net solvable binary words (English)
0 references
18 December 2019
0 references
Petri net
0 references
binary word
0 references
word solvability
0 references
reversibility
0 references
binary transition system
0 references
