2nd International Conference on Dependability of Computer Systems (DepCoS-RELCOMEX '07) 2007
DOI: 10.1109/depcos-relcomex.2007.53
|View full text |Cite
|
Sign up to set email alerts
|

Verification of Component Behavioral Compatibility

Abstract: In

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2008
2008
2011
2011

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 13 publications
(14 reference statements)
0
3
0
Order By: Relevance
“…The composition operation follows the CORD (compatible or deadlocked) composition proposed in [4], [5], [6] for the verification of component compatibility.…”
Section: Component Compositionmentioning
confidence: 99%
See 1 more Smart Citation
“…The composition operation follows the CORD (compatible or deadlocked) composition proposed in [4], [5], [6] for the verification of component compatibility.…”
Section: Component Compositionmentioning
confidence: 99%
“…Petri net models proposed earlier for the verification of component compatibility [5], [6], are extended by temporal characteristics of provided services. This makes it possible to study the performance aspects of modeled systems and to verify their time-critical behavior.…”
Section: Introductionmentioning
confidence: 99%
“…It is known that languages defined by (labelled) Petri nets include regular languages, some context-free and even context-sensitive languages (Murata, 1989). Therefore, they are significantly more general than languages defined by finite automata (Chaki et al, 2004); however, the verification of component compatibility is significantly more difficult than in the case of regular languages (Craig and Zuberek, 2007;Craig, 2006).…”
Section: Introductionmentioning
confidence: 99%