Results 1 
8 of
8
Specifying Communication in Distributed Information Systems
 Acta Informatica
, 1998
"... . In this paper, we present two logics that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers convenient specifica ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
. In this paper, we present two logics that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers convenient specification features that are not easy to implement. We show that D 1 specifications may be automatically translated to D 0 in a sound and complete way. In order to prove soundness and completeness, we define our translation as a simple map of institutions. Our result may be useful for making implementation platforms like Corba easier accessible by providing highlevel planning and specification methods for communication. 1 Introduction Two logics are presented that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers...
Precategories for Combining Probabilistic Automata
 Electronic Notes in Theoretical Computer Science
, 1999
"... A relaxed notion of category is presented having in mind the categorical caracterization of the mechanisms for combining probabilistic automata, since the composition of the appropriate morphisms is not always defined. A detailed discussion of the required notion of morphism is provided. The partial ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
A relaxed notion of category is presented having in mind the categorical caracterization of the mechanisms for combining probabilistic automata, since the composition of the appropriate morphisms is not always defined. A detailed discussion of the required notion of morphism is provided. The partiality of composition of such morphisms is illustrated at the abstract level of countable probability spaces. The relevant fragment of the theory of the proposed precategories is developed, including (constrained) products and Cartesian liftings. Precategories are precisely placed in the universe of neocategories. Some classical results from category theory are shown to carry over to precategories. Other results are shown not to hold in general. As an application, the precategorical universal constructs are used for characterizing the basic mechanisms for combining probabilistic automata: aggregation, interconnection and state constraining. Mathematics Subject Classifications: 18A10 68Q75. Ke...
Algebraic treatment of featureoriented systems
 In [12
, 2000
"... Abstract. An important aspect of the feature interaction problem is to formally capture the notion of feature interactions. Although this notion is quite well informally understood by the researchers of the domain, the way, they handle it, strongly depends on the field of investigation they decide t ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract. An important aspect of the feature interaction problem is to formally capture the notion of feature interactions. Although this notion is quite well informally understood by the researchers of the domain, the way, they handle it, strongly depends on the field of investigation they decide to work on (formal method application, architectural conception, technological research...). In this article, we focus on how formally specifying and studying feature systems, and both integration and interaction of features. More precisely, we aim to give a logicindependent framework to deal with the notions of feature, featurebased systems and feature interactions. Then, to help the reader's intuition, we instantiate it by a dynamic algebraic formalism and we give concrete examples of interactions between two features previously described in this formalism.
INTERCONNECTION OF PROBABILISTIC SYSTEMS
, 2000
"... There is a growing interest in models for probabilistic systems. This fact is motivated by engineering applications, namely in problems concerning the evaluation of the performance of systems. It is of ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
There is a growing interest in models for probabilistic systems. This fact is motivated by engineering applications, namely in problems concerning the evaluation of the performance of systems. It is of
Deriving Liveness Goals from Temporal Logic Specifications
 Journal of Symbolic Computation
, 1996
"... Introduction The use of temporal logic has been widely explored both on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Introduction The use of temporal logic has been widely explored both on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and Saake, 1991), (Kung, 1984), (Lipeck and Saake, 1987), (Schwiderski, Hartmann and Saake, 1994). The advantages are known to lie on the clear declarative formalization of the system at hand and on the use of temporal verification techniques to prove properties of the specified systems. Temporal logic specification has also given an important contribution towards the establishment of suitable compositional specification frameworks (Barringer, Kuiper and Pnueli, 1984).  This work was partly supported by CEC under ESPRITIII BRA WG 6071 ISCORE (Information S
Canonical Institutions of Behaviour
"... Abstract. The concept of behaviour plays a central role in the specification of a considerable number of different kinds of systems. In these settings a “behaviour ” is seen as a possible evolution (or lifecycle) of the system, whereas the system itself is considered to be defined by the set of all ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The concept of behaviour plays a central role in the specification of a considerable number of different kinds of systems. In these settings a “behaviour ” is seen as a possible evolution (or lifecycle) of the system, whereas the system itself is considered to be defined by the set of all its possible behaviours. Examples of this kind of situation are common. Maybe the most well known and studied is that of concurrency theory: a behaviour is e.g. a stream of actions and the system is a process (in this case, a set of streams of actions). If institutions are used as the way for specifying the systems, then it is customary to start by creating an institution for individual behaviours (where each model corresponds to a possible behaviour) from which the “system institution ” or “institution of behaviour”, in our terminology where each model is a set of behaviours is built. The new institution is tightly bound to the base institution, sharing signatures and languages. Also, because the models are obtained from the base institution’s models, the satisfaction relation is defined in terms of the base satisfaction relation. In this paper it is shown that the construction of these institutions of behaviour can be carried out in a canonical way. Indeed, the construction does not depend in any way at all on the particular base institution chosen. It is also shown that several institutions presented since the 90’s in WADT workshops and elsewhere arise as particular cases of this canonical construction [4, 2, 3, 6–8]. It is hoped that the proposed construction can be used as a shortcut for defining new useful institutions of behaviour. 1
Complex software systems: Formalization and Applications ∗
, 2013
"... A mathematical denotation is proposed for the notion of complex software systems whose behavior is specified by rigorous formalisms. Complex systems are described in a recursive way as an interconnection of subsystems by means of architectural connectors. In order to consider the largest family of s ..."
Abstract
 Add to MetaCart
(Show Context)
A mathematical denotation is proposed for the notion of complex software systems whose behavior is specified by rigorous formalisms. Complex systems are described in a recursive way as an interconnection of subsystems by means of architectural connectors. In order to consider the largest family of specification formalisms and architectural connectors, this denotation is essentially formalism, specification and connector independent. For this, we build framework, we characterize complexity by the notion of property emergence.