Reachability analysis for timed automata using max-plus algebra (Q444476)
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: Reachability analysis for timed automata using max-plus algebra |
scientific article; zbMATH DE number 6065757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability analysis for timed automata using max-plus algebra |
scientific article; zbMATH DE number 6065757 |
Statements
Reachability analysis for timed automata using max-plus algebra (English)
0 references
14 August 2012
0 references
timed automaton
0 references
real-time model checking
0 references
data structure
0 references
max-plus algebra
0 references
max-plus polyhedron
0 references
0.7978251576423645
0 references
0.7669292688369751
0 references
