Communicating Timed Automata: The More Synchronous, the More Difficult to Verify (Q5756736)
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 5187398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communicating Timed Automata: The More Synchronous, the More Difficult to Verify |
scientific article; zbMATH DE number 5187398 |
Statements
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify (English)
0 references
5 September 2007
0 references
0.883488118648529
0 references
0.800970733165741
0 references
0.7787405848503113
0 references
0.7715361714363098
0 references
0.7672899961471558
0 references
