Fast algorithms for handling diagonal constraints in timed automata (Q6154574)
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: Fast algorithms for handling diagonal constraints in timed automata |
scientific article; zbMATH DE number 7805525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for handling diagonal constraints in timed automata |
scientific article; zbMATH DE number 7805525 |
Statements
Fast algorithms for handling diagonal constraints in timed automata (English)
0 references
16 February 2024
0 references
timed automata
0 references
diagonal constraints
0 references
reachability
0 references
0.8980095386505127
0 references
0.818230390548706
0 references
0.7506895065307617
0 references
0.7432835698127747
0 references
