Results 1  10
of
134
A Tutorial on (Co)Algebras and (Co)Induction
 EATCS Bulletin
, 1997
"... . Algebraic structures which are generated by a collection of constructors like natural numbers (generated by a zero and a successor) or finite lists and trees are of wellestablished importance in computer science. Formally, they are initial algebras. Induction is used both as a definition pr ..."
Abstract

Cited by 244 (35 self)
 Add to MetaCart
(Show Context)
. Algebraic structures which are generated by a collection of constructors like natural numbers (generated by a zero and a successor) or finite lists and trees are of wellestablished importance in computer science. Formally, they are initial algebras. Induction is used both as a definition principle, and as a proof principle for such structures. But there are also important dual "coalgebraic" structures, which do not come equipped with constructor operations but with what are sometimes called "destructor" operations (also called observers, accessors, transition maps, or mutators). Spaces of infinite data (including, for example, infinite lists, and nonwellfounded sets) are generally of this kind. In general, dynamical systems with a hidden, blackbox state space, to which a user only has limited access via specified (observer or mutator) operations, are coalgebras of various kinds. Such coalgebraic systems are common in computer science. And "coinduction" is the appropriate te...
SpatioTemporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases
, 1999
"... Spatiotemporal databases deal with geometries changing over time. In general, geometries cannot only change in discrete steps, but continuously, and we are talking about moving objects. If only the position in space of an object is relevant, then moving point is a basic abstraction; if also the ext ..."
Abstract

Cited by 151 (37 self)
 Add to MetaCart
(Show Context)
Spatiotemporal databases deal with geometries changing over time. In general, geometries cannot only change in discrete steps, but continuously, and we are talking about moving objects. If only the position in space of an object is relevant, then moving point is a basic abstraction; if also the extent is of interest, then the moving region abstraction captures moving as well as growing or shrinking regions. We propose a new line of research where moving points and moving regions are viewed as threedimensional (2D space + time) or higherdimensional entities whose structure and behavior is captured by modeling them as abstract data types. Such types can be integrated as base (attribute) data types into relational, objectoriented, or other DBMS data models; they can be implemented as data blades, cartridges, etc. for extensible DBMSs. We expect these spatiotemporal data types to play a similarly fundamental role for spatiotemporal databases as spatial data types have played for sp...
Generation of Components for Software Renovation Factories from Contextfree Grammars
"... We present an approach for the generation of components for a software renovation factory. These components are generated from a contextfree grammar definition that recognizes the code that has to be renovated. We generate analysis and transformation components that can be instantiated with a speci ..."
Abstract

Cited by 76 (27 self)
 Add to MetaCart
We present an approach for the generation of components for a software renovation factory. These components are generated from a contextfree grammar definition that recognizes the code that has to be renovated. We generate analysis and transformation components that can be instantiated with a specific transformation or analysis task. We apply our approach to COBOL and we discuss the construction of realistic software renovation components using our approach.
Objects and Classes, Coalgebraically
 ObjectOrientation with Parallelism and Persistence
, 1995
"... The coalgebraic perspective on objects and classes in objectoriented programming is elaborated: objects consist of a (unique) identifier, a local state, and a collection of methods described as a coalgebra; classes are coalgebraic (behavioural) specifications of objects. The creation of a "n ..."
Abstract

Cited by 71 (18 self)
 Add to MetaCart
(Show Context)
The coalgebraic perspective on objects and classes in objectoriented programming is elaborated: objects consist of a (unique) identifier, a local state, and a collection of methods described as a coalgebra; classes are coalgebraic (behavioural) specifications of objects. The creation of a "new" object of a class is described in terms of the terminal coalgebra satisfying the specification. We present a notion of "totally specified" class, which leads to particularly simple terminal coalgebras. We further describe local and global operational semantics for objects. Associated with the local operational semantics is a notion of bisimulation (for objects belonging to the same class), expressing observational indistinguishability. AMS Subject Classification (1991): 18C10, 03G30 CR Subject Classification (1991): D.1.5, D.2.1, E.1, F.1.1, F.3.0 Keywords & Phrases: object, class, (terminal) coalgebra, coalgebraic specification, bisimulation 1. Introduction Within the objectoriente...
Object Specification Logic
 Journal of Logic and Computation
, 1995
"... A logic for specifying and reasoning about object classes and their instances (aspects) is presented and illustrated. This logic is an extension of a rather standard linear temporal, manysorted, firstorder predicate logic with equality. The extensions where designed to be as simple as possible whi ..."
Abstract

Cited by 63 (12 self)
 Add to MetaCart
(Show Context)
A logic for specifying and reasoning about object classes and their instances (aspects) is presented and illustrated. This logic is an extension of a rather standard linear temporal, manysorted, firstorder predicate logic with equality. The extensions where designed to be as simple as possible while supporting the envisaged locality of arguments, object specialization and object aggregation. Objects are specified through their aspects. Each aspect establishes a local vocabulary (signature). The logic works at two levels: first, we can specify and prove assertions about a given object aspect in isolation (local reasoning), eg persons, or patients, or cars; second, we can specify interaction constraints and make inferences between aspects within the same community of objects (global reasoning), eg carry the theorems of persons onto patients (specialization inheritance), or carry the theorems of persons onto the aggregations of persons and cars (incorporation inheritance). Some reflecti...
Observational logic
 IN ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY (AMAST'98
, 1999
"... We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required ..."
Abstract

Cited by 55 (10 self)
 Add to MetaCart
We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the given observers. In particular, we introduce a homomorphism concept for observational algebras which adequately expresses observational relationships between algebras. Then we consider a flexible notion of observational signature morphism which guarantees the satisfaction condition of institutions w.r.t. observational satisfaction of arbitrary firstorder sentences. From the proof theoretical point of view we construct a sound and complete proof system for the observational consequence relation. Then we consider structured observational specifications and we provide a sound and complete proof system for such specifications by using a general, institutionindependent result of [6].
Cooperative Nets
 Proceedings of 15th International Conference on the Application and Theory of Petri Nets, Lecture Notes in Computer Science 815
, 1994
"... : The behavior of some kinds of systems features a high rate of dynamic evolution. The system running causes the introduction of new components whereas some others disappear, and links between components are dynamically set: a component sometimes interacts with given components and sometimes with o ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
: The behavior of some kinds of systems features a high rate of dynamic evolution. The system running causes the introduction of new components whereas some others disappear, and links between components are dynamically set: a component sometimes interacts with given components and sometimes with others. It is uneasy to capture such evolution inside Petri nets whose structure is fixed; but it is necessary to respect the Petri net semantics and keep the possibility to apply the structural analysis technics. The paper introduces two extensions of Petri nets dealing with this problem, Communicative Nets and Cooperative Nets. They enable to model a system as a collection of nets which encapsulate their behavior, while interacting by means of message sending or a client/ server protocol; a net may instantiate another net, and the links between nets are dynamic. An algorithm is given which captures this dynamicity by building a single fixed net whose behavior is equivalent to a whole system...
Geospatial Semantics: Why, of What and How
 In: Journal on Data Semantics III, Lecture Notes in Computer Science, Springer Berlin/Heidelberg, ISBN: 9783540262251, Computer Science, Volume 3534/2005, ISSN
, 2005
"... Abstract. Why are notions like semantics and ontologies suddenly getting so much attention, within and outside geospatial information communities? The main reason lies in the componentization of Geographic Information Systems (GIS) into services, which are supposed to interoperate within and across ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Why are notions like semantics and ontologies suddenly getting so much attention, within and outside geospatial information communities? The main reason lies in the componentization of Geographic Information Systems (GIS) into services, which are supposed to interoperate within and across these communities. Consequently, I look at geospatial semantics in the context of semantic interoperability. The paper clarifies the relevant notion of semantics and shows what parts of geospatial information need to receive semantic specifications in order to achieve interoperability. No attempt at a survey of approaches to provide semantics is made, but a framework for solving interoperability problems is proposed in the form of semantic reference systems. Particular emphasis is put on the need and possible ways to ground geospatial semantics in physical processes and measurements. 1. Introduction: Why