2007
DOI: 10.1007/978-3-540-73196-2_4
|View full text |Cite
|
Sign up to set email alerts
|

Specification of Timed EFSM Fault Models in SDL

Abstract: Abstract. In this paper, we apply our timing fault modeling strategy to writing formal specifications for communication protocols. Using the formal language of Specification and Description Language (SDL), we specify the Controller process of rail-road crossing system, a popular benchmark for real-time systems. Our extended finite state machine (EFSM) model has the capability of representing a class of timing faults, which otherwise may not be detected in an IUT. Hit-or-Jump algorithm is applied to the SDL spe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0
3

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 14 publications
0
10
0
3
Order By: Relevance
“…Approaches described in [11][12][13]17] present mutation operators targeting formal abstract models, independently from specific programming languages. In [11], the great variety of operators used to introduce mutation in graph-based models is gathered into two basic operations (i.e., insertion and omission) and their combinations.…”
Section: Introductionmentioning
confidence: 99%
“…Approaches described in [11][12][13]17] present mutation operators targeting formal abstract models, independently from specific programming languages. In [11], the great variety of operators used to introduce mutation in graph-based models is gathered into two basic operations (i.e., insertion and omission) and their combinations.…”
Section: Introductionmentioning
confidence: 99%
“…Mutation operators have also been defined for modeling languages such as finite state machines [8,18,26], state charts [32,52], Petri nets [17], and timed automata [44]. Mutation operators for models focus on the modeling elements and can do things like remove an element or change the target node for an edge.…”
Section: Mutation-based Testingmentioning
confidence: 99%
“…The more classical proposals are usually based on timed automata, although recent proposals tend to consider other formalisms such as temporal extensions of labeled transition systems and of finite state machines (e.g. [4,34,35,44,48]). Due to the intrinsical difficulty behind testing timed systems, different approaches to the problem have been exercised, falling into one or more of the following categories.…”
Section: Related Workmentioning
confidence: 99%