Well-abstracted transition systems: Application to FIFO automata. (Q1401924): Difference between revisions
From MaRDI portal
Latest revision as of 08:56, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Well-abstracted transition systems: Application to FIFO automata. |
scientific article |
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