592 search results - page 7 / 119 » Can Component Service-Based Systems Be Proved Correct |
OTM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Protocols that govern the interactions between software components are a popular means to support the construction of correct component-based systems. Previous studies ha...
LATA
2009
Springer
14 years 21 hour ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
MKM
2009
Springer
14 years 16 hour ago
2009
Springer
Hilbert’s concept of formal proof is an ideal of rigour for mathematics which has important applications in mathematical logic, but seems irrelevant for the practice of mathemati...
FUIN
2002
13 years 7 months ago
2002
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
EUROMICRO
2002
IEEE
14 years 12 days ago
2002
IEEE
In this paper we propose a method for predicting the consequences of adding new components to an existing product line in the real-time systems domain. We refer to such a predicti...