The computational complexity of scenario-based agent verification and design (Q2372186)
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 5174338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of scenario-based agent verification and design |
scientific article; zbMATH DE number 5174338 |
Statements
The computational complexity of scenario-based agent verification and design (English)
0 references
25 July 2007
0 references
scenarios
0 references
strategies
0 references
AUML
0 references
live sequence charts
0 references
synthesis
0 references
model checking
0 references
computational complexity
0 references
0.89118433
0 references
0.8845148
0 references
0.86105573
0 references
0.85180163
0 references
0.8488773
0 references
