Marcello Bonsangue - Academia.edu (original) (raw)
Uploads
Papers by Marcello Bonsangue
In this paper we report on the use of XML transformations in the context of Enterprise Architectu... more In this paper we report on the use of XML transformations in the context of Enterprise Architectures. We show that XML transformation techniques can be applied to visualize and analyze enterprise architectures in a formal way. We propose transformational techniques to extract views from an XML document containing architectural information and indicate how to perform a specific form of impact analysis on this information. The transformations are formally expressed with the language RML, a compact yet powerful transformation language developed at CWI, which obtains its power from regular expressions defined on XML documents. We discuss a tool that has been built on top of it to visualize the results of the transformations and illustrate the advantages of our approach: the genericity of XML, the application of a single technique (namely XML transformations) for various tasks, and the benefits of having a model viewer which is in complete ignorance of the architectural language used.
Lecture Notes in Computer Science, 2005
We present a fully abstract semantics for components. This semantics is formalized in terms of a ... more We present a fully abstract semantics for components. This semantics is formalized in terms of a notion of trace for components, providing a description of the component externally observable behavior inspired by UML sequence diagrams. Such a description abstracts from the actual implementation given by UML state-machines. Our full abstraction result is based on a may testing semantics which involves a composition of components in terms of cross-border dynamic class instantiation through component interfaces.
We present a fully abstract semantics for UML components. This semantics is formalized in terms o... more We present a fully abstract semantics for UML components. This semantics is formalized in terms of a notion of trace for components, providing a description of the component externally observable behavior inspired by UML sequence diagrams. Such a description abstracts from the actual implementation given by UML state-machines. Our full abstraction result is based on a may testing semantics which involves a composition of components in terms of crossborder dynamic class instantiation through component interfaces.
terms of cross-border dynamic class instantiation through component interfaces. This is the first... more terms of cross-border dynamic class instantiation through component interfaces. This is the first such result for a concurrent object-oriented language with dynamic class instantiation.
For two parallel languages with recursion a compositional weakest precondition semantics is given... more For two parallel languages with recursion a compositional weakest precondition semantics is given using two new metric resumption domains. The underlying domains are characterized by domain equations involving functors that deliver`observable' and`safety' predicate transformers. Further a re nement relation is de ned for this domains and illustrated by rules dealing with concurrent composition. It turns out, by extending the classical duality of predicate vs. state transformers, that the weakest precondition semantics for the parallel languages is isomorphic to the standard metric state transformers semantics. Moreover, the proposed re nement relation on the predicate transformer domain will correspond to the familiar notion of simulation in the state transformer domain.
Coordination Models and Languages, 1999
Lecture Notes in Computer Science, 2006
Proceedings. Eighth IEEE International Enterprise Distributed Object Computing Conference, 2004. EDOC 2004., 2004
In this paper we introduce a logical viewpoint on architectures. The logical viewpoint is based o... more In this paper we introduce a logical viewpoint on architectures. The logical viewpoint is based on the distinction between symbolic and semantic models of architectures. The core of a symbolic model consists of its signature that specifies symbolically its structural elements and their relationships. A semantic model is defined as a formal interpretation of the symbolic model. This leads to more precise characterization of the concepts introduced in IEEE standard 1471-2000, and provides a formal approach to the design of enterprise of architectural description languages and a general mathematical foundation for the use of formal methods in enterprise architectures.
Lecture Notes in Computer Science, 2008
We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and... more We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every formula into a finite Mealy machine whose behaviour is exactly the set of causal functions satisfying the formula.
IRI -2005 IEEE International Conference on Information Reuse and Integration, Conf, 2005., 2005
An enterprise architecture is a high-level description intended to capture the vision of an enter... more An enterprise architecture is a high-level description intended to capture the vision of an enterprise integrating all its dimensions: organization structure, business processes, and infrastructure. Every single part of an enterprise is subject to change, and each change may have significant consequences within all domains of the enterprise. A lot of effort is therefore devoted to maintaining the integrity of an architectural description.
Proceedings of the 38th Annual Hawaii International Conference on System Sciences, 2005
This paper shows how XML can be used for static and dynamic analysis of architectures. Our analys... more This paper shows how XML can be used for static and dynamic analysis of architectures. Our analysis is based on the distinction between symbolic and semantic models of architectures. The core of a symbolic model consists of its signature that specifies symbolically its structural elements and their relationships. A semantic model is defined as a formal interpretation of the symbolic model. This provides a formal approach to the design of architectural description languages and a general mathematical foundation for the use of formal methods in enterprise architectures. For dynamic analysis we define transformations of models of architectures, modeled in XML, and for this purpose the XML vocabulary for an architecture is extended with a few constructs defined in the Rule Markup Language (RML). There are RML tools available that perform the desired transformations.
Coalgebras provide a uniform framework for the study of dynamical systems, including several type... more Coalgebras provide a uniform framework for the study of dynamical systems, including several types of automata. The coalgebraic view on systems has recently been proved relevant by the development of a number of expression calculi which generalize classical results by Kleene, on regular expressions, and by Kozen, on Kleene algebra. This note contains an overview of the motivation and results of the generic framework we developed – Kleene Coalgebra – to uniformly de-rive the aforementioned calculi. We present an historical overview of work on regular expressions and axiomatizations, as well a discussion of related work. We show applications of the framework to three types of probabilistic systems: simple Segala, stratified and Pnueli-Zuck.
Lecture Notes in Computer Science, 2000
. We introduce a state-based language for programming dynamicallychanging networks which consist ... more . We introduce a state-based language for programming dynamicallychanging networks which consist of processes that communicateasynchronously. For this language we introduce an operationalsemantics and a notion of observable which includes both partial correctnessand absence of deadlock. Our main result is a compositionalcharacterization of this notion of observable for a confluent sub-language.1 IntroductionThe goal of this paper is to develop a
Proceedings of the 1999 ACM symposium on Applied computing - SAC '99, 1999
Page 1. Comparing coordination models based on shared distributed replicated data Marcello M. Bon... more Page 1. Comparing coordination models based on shared distributed replicated data Marcello M. Bonsangue and Joost N. Kok Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands e-mail: marcelloQcs.leidenuniv.nl and jooat0ca.leidenuniv.al ...
Lecture Notes in Computer Science, 1995
In this paper we report on the use of XML transformations in the context of Enterprise Architectu... more In this paper we report on the use of XML transformations in the context of Enterprise Architectures. We show that XML transformation techniques can be applied to visualize and analyze enterprise architectures in a formal way. We propose transformational techniques to extract views from an XML document containing architectural information and indicate how to perform a specific form of impact analysis on this information. The transformations are formally expressed with the language RML, a compact yet powerful transformation language developed at CWI, which obtains its power from regular expressions defined on XML documents. We discuss a tool that has been built on top of it to visualize the results of the transformations and illustrate the advantages of our approach: the genericity of XML, the application of a single technique (namely XML transformations) for various tasks, and the benefits of having a model viewer which is in complete ignorance of the architectural language used.
Lecture Notes in Computer Science, 2005
We present a fully abstract semantics for components. This semantics is formalized in terms of a ... more We present a fully abstract semantics for components. This semantics is formalized in terms of a notion of trace for components, providing a description of the component externally observable behavior inspired by UML sequence diagrams. Such a description abstracts from the actual implementation given by UML state-machines. Our full abstraction result is based on a may testing semantics which involves a composition of components in terms of cross-border dynamic class instantiation through component interfaces.
We present a fully abstract semantics for UML components. This semantics is formalized in terms o... more We present a fully abstract semantics for UML components. This semantics is formalized in terms of a notion of trace for components, providing a description of the component externally observable behavior inspired by UML sequence diagrams. Such a description abstracts from the actual implementation given by UML state-machines. Our full abstraction result is based on a may testing semantics which involves a composition of components in terms of crossborder dynamic class instantiation through component interfaces.
terms of cross-border dynamic class instantiation through component interfaces. This is the first... more terms of cross-border dynamic class instantiation through component interfaces. This is the first such result for a concurrent object-oriented language with dynamic class instantiation.
For two parallel languages with recursion a compositional weakest precondition semantics is given... more For two parallel languages with recursion a compositional weakest precondition semantics is given using two new metric resumption domains. The underlying domains are characterized by domain equations involving functors that deliver`observable' and`safety' predicate transformers. Further a re nement relation is de ned for this domains and illustrated by rules dealing with concurrent composition. It turns out, by extending the classical duality of predicate vs. state transformers, that the weakest precondition semantics for the parallel languages is isomorphic to the standard metric state transformers semantics. Moreover, the proposed re nement relation on the predicate transformer domain will correspond to the familiar notion of simulation in the state transformer domain.
Coordination Models and Languages, 1999
Lecture Notes in Computer Science, 2006
Proceedings. Eighth IEEE International Enterprise Distributed Object Computing Conference, 2004. EDOC 2004., 2004
In this paper we introduce a logical viewpoint on architectures. The logical viewpoint is based o... more In this paper we introduce a logical viewpoint on architectures. The logical viewpoint is based on the distinction between symbolic and semantic models of architectures. The core of a symbolic model consists of its signature that specifies symbolically its structural elements and their relationships. A semantic model is defined as a formal interpretation of the symbolic model. This leads to more precise characterization of the concepts introduced in IEEE standard 1471-2000, and provides a formal approach to the design of enterprise of architectural description languages and a general mathematical foundation for the use of formal methods in enterprise architectures.
Lecture Notes in Computer Science, 2008
We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and... more We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every formula into a finite Mealy machine whose behaviour is exactly the set of causal functions satisfying the formula.
IRI -2005 IEEE International Conference on Information Reuse and Integration, Conf, 2005., 2005
An enterprise architecture is a high-level description intended to capture the vision of an enter... more An enterprise architecture is a high-level description intended to capture the vision of an enterprise integrating all its dimensions: organization structure, business processes, and infrastructure. Every single part of an enterprise is subject to change, and each change may have significant consequences within all domains of the enterprise. A lot of effort is therefore devoted to maintaining the integrity of an architectural description.
Proceedings of the 38th Annual Hawaii International Conference on System Sciences, 2005
This paper shows how XML can be used for static and dynamic analysis of architectures. Our analys... more This paper shows how XML can be used for static and dynamic analysis of architectures. Our analysis is based on the distinction between symbolic and semantic models of architectures. The core of a symbolic model consists of its signature that specifies symbolically its structural elements and their relationships. A semantic model is defined as a formal interpretation of the symbolic model. This provides a formal approach to the design of architectural description languages and a general mathematical foundation for the use of formal methods in enterprise architectures. For dynamic analysis we define transformations of models of architectures, modeled in XML, and for this purpose the XML vocabulary for an architecture is extended with a few constructs defined in the Rule Markup Language (RML). There are RML tools available that perform the desired transformations.
Coalgebras provide a uniform framework for the study of dynamical systems, including several type... more Coalgebras provide a uniform framework for the study of dynamical systems, including several types of automata. The coalgebraic view on systems has recently been proved relevant by the development of a number of expression calculi which generalize classical results by Kleene, on regular expressions, and by Kozen, on Kleene algebra. This note contains an overview of the motivation and results of the generic framework we developed – Kleene Coalgebra – to uniformly de-rive the aforementioned calculi. We present an historical overview of work on regular expressions and axiomatizations, as well a discussion of related work. We show applications of the framework to three types of probabilistic systems: simple Segala, stratified and Pnueli-Zuck.
Lecture Notes in Computer Science, 2000
. We introduce a state-based language for programming dynamicallychanging networks which consist ... more . We introduce a state-based language for programming dynamicallychanging networks which consist of processes that communicateasynchronously. For this language we introduce an operationalsemantics and a notion of observable which includes both partial correctnessand absence of deadlock. Our main result is a compositionalcharacterization of this notion of observable for a confluent sub-language.1 IntroductionThe goal of this paper is to develop a
Proceedings of the 1999 ACM symposium on Applied computing - SAC '99, 1999
Page 1. Comparing coordination models based on shared distributed replicated data Marcello M. Bon... more Page 1. Comparing coordination models based on shared distributed replicated data Marcello M. Bonsangue and Joost N. Kok Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands e-mail: marcelloQcs.leidenuniv.nl and jooat0ca.leidenuniv.al ...
Lecture Notes in Computer Science, 1995