Verification of well-formed communicating recursive state machines (Q944388)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Verification of well-formed communicating recursive state machines |
scientific article; zbMATH DE number 5344356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verification of well-formed communicating recursive state machines |
scientific article; zbMATH DE number 5344356 |
Statements
Verification of well-formed communicating recursive state machines (English)
0 references
16 September 2008
0 references
infinite-state systems
0 references
pushdown systems
0 references
formal models of concurrency and recursion
0 references
model checking
0 references
linear-time logics
0 references
context-free specifications
0 references
tree automata
0 references
0 references
0.9999999
0 references
0.8912588
0 references
0.8785476
0 references
0 references
0.8781173
0 references
