(2015). Verification for Timed Automata extended with Unbounded Discrete Data Structures. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Verification for Timed Automata Extended with Unbounded Discrete Data Structures."
Logical Methods in Computer Science 2015.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Verification for Timed Automata Extended with Unbounded Discrete Data Structures."
Logical Methods in Computer Science, 2015.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.