Timed I/O Automata: It is never too late to complete your timed specification theory.
Martijn A. GoordenKim G. LarsenAxel LegayFlorian LorberUlrik NymanAndrzej WasowskiPublished in: CoRR (2023)
Keyphrases
- timed automata
- petri net
- finite state machines
- colored petri nets
- model checking
- formal languages
- databases
- input output
- theoretical framework
- markov chain
- cellular automata
- formal methods
- specification language
- general theory
- high level
- parallel algorithm
- main memory
- information theory
- file system
- computational model
- learning automata
- provably correct
- real time