Verification in loosely synchronous queue-connected discrete timed automata.
Oscar H. IbarraZhe DangPierluigi San PietroPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- timed automata
- model checking
- reachability analysis
- temporal logic
- formal verification
- simply connected
- verification method
- discrete geometry
- theorem prover
- queue length
- first order logic
- arrival rate
- formal methods
- finite number
- machine learning
- asynchronous communication
- steady state
- finite capacity
- traffic intensity
- hazard rate
- service times
- single server
- asymptotically optimal
- theorem proving
- markov decision processes