Well-abstracted transition systems: Application to FIFO automata. (Q1401924)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1967117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Well-abstracted transition systems: Application to FIFO automata. |
scientific article; zbMATH DE number 1967117 |
Statements
Well-abstracted transition systems: Application to FIFO automata. (English)
0 references
19 August 2003
0 references
Infinite state systems
0 references
Abstraction
0 references
Symbolic representation
0 references
Acceleration
0 references
Protocols
0 references
FIFO automata
0 references
Regular expressions
0 references
Flatness
0 references
0 references
0 references
0 references
0 references
0.7343347668647766
0 references
0.7333124876022339
0 references
0.7304118275642395
0 references
0.7304118275642395
0 references
