2008 Second International Conference on Research Challenges in Information Science 2008
DOI: 10.1109/rcis.2008.4632087
|View full text |Cite
|
Sign up to set email alerts
|

AADL behavioral annex based on generalized rewriting logic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2010
2010
2012
2012

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…Work in class (ii) includes [9,1,2,8]; they all assume that thread behavior is specified outside AADL, but differ on how this is done. [9] uses the Lustre synchronous language; [1] uses communicating timed automata; [2] uses rewrite rules; and [8] uses Ada.…”
Section: Related Workmentioning
confidence: 99%
“…Work in class (ii) includes [9,1,2,8]; they all assume that thread behavior is specified outside AADL, but differ on how this is done. [9] uses the Lustre synchronous language; [1] uses communicating timed automata; [2] uses rewrite rules; and [8] uses Ada.…”
Section: Related Workmentioning
confidence: 99%
“…Leicester University gives a natural semantic model to the AADL thread component. And associated to the thread component, a behavioral annex based on generalized rewriting logic is proposed [6]. The aim is to be able to formally check a large set of properties of AADL threads via analysis tools of Maude environment.…”
Section: Related Workmentioning
confidence: 99%
“…Each decision tree has a root node including the proposed change and the starting requirement. For each unvisited related requirement, the change is propagated (see lines [15][16][17][18][19]. If the related requirement is not visited before, then the propagateChange function is called (see line 18).…”
Section: Change Propagation and Change Consistency Checkingmentioning
confidence: 99%
“…The algorithm is iterative (see lines [15][16][17][18][19][20][21]. For each decision tree, the set of visited requirements is copied and the directly related requirement to which the change alternatives are introduced becomes the starting requirement.…”
Section: Change Propagation and Change Consistency Checkingmentioning
confidence: 99%
See 1 more Smart Citation