Diamonds are a girl's best friend: Partial order reduction for timed automata with abstractions
A major obstacle for using partial order reduction in the context of real time verification is that the presence of clocks and clock constraints breaks the usual diamond structure of otherwise independent transitions. This is especially true when information of the relative values of clocks is prese...
Saved in:
Main Authors: | HANSEN, Henri, LIN, Shang-Wei, LIU, Yang, NGUYEN, Truong Khanh, SUN, Jun |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2014
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/4956 https://ink.library.smu.edu.sg/context/sis_research/article/5959/viewcontent/diamonds.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
An efficient algorithm for learning event-recording automata
由: LIN, Shang-Wei, et al.
出版: (2011) -
Scaling BDD-based timed verification with simulation reduction
由: NGUYEN, Truong Khanh, et al.
出版: (2016) -
Verification of orchestration systems using compositional partial order reduction
由: TAN, Tian Huat, et al.
出版: (2011) -
Timed automata patterns
由: DONG, Jin Song, et al.
出版: (2008) -
Generating programming exercises with changeable complexity and level of abstraction
由: Tiam-Lee, Thomas James Z., et al.
出版: (2018)