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 |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2014
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4956 https://ink.library.smu.edu.sg/context/sis_research/article/5959/viewcontent/diamonds.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
An efficient algorithm for learning event-recording automata
by: LIN, Shang-Wei, et al.
Published: (2011) -
Scaling BDD-based timed verification with simulation reduction
by: NGUYEN, Truong Khanh, et al.
Published: (2016) -
Verification of orchestration systems using compositional partial order reduction
by: TAN, Tian Huat, et al.
Published: (2011) -
Timed automata patterns
by: DONG, Jin Song, et al.
Published: (2008) -
Generating programming exercises with changeable complexity and level of abstraction
by: Tiam-Lee, Thomas James Z., et al.
Published: (2018)