2014
DOI: 10.4018/ijertcs.2014040103
|View full text |Cite
|
Sign up to set email alerts
|

True Concurrency Semantics

Abstract: The model checking algorithms have been widely studied for timed automata, it's a validation technique for automatically verifying correctness properties of finite-state systems, which are based on interleaving semantics. Therefore the actions are assumed instantaneous. To overcome the hypothesis of temporal and structural atomicity of actions, we use the durational actions timed automata model (daTA). This model is based on the maximality semantics. Properties to be verified are expressed using the Timed Comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…To verify some behavioural properties, the logic CTL (Computation Tree Logic) (Clarke et al, 1986) is used to specify those properties. In UPPAAL tool, the CTL properties are applied on the system's state space, in order to detect precocious errors in the progress (Guellati et al, 2014).…”
Section: Timed Automata (Alur and Dill 1994)mentioning
confidence: 99%
“…To verify some behavioural properties, the logic CTL (Computation Tree Logic) (Clarke et al, 1986) is used to specify those properties. In UPPAAL tool, the CTL properties are applied on the system's state space, in order to detect precocious errors in the progress (Guellati et al, 2014).…”
Section: Timed Automata (Alur and Dill 1994)mentioning
confidence: 99%