Results 1  10
of
23
The monadic secondorder logic of graphs I. Recognizable sets of Finite Graphs
 Information and Computation
, 1990
"... The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic secondorder logic is recognizable, but not vice versa. The monadic secondorder theory of a contextfree set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins ..."
Abstract

Cited by 205 (16 self)
 Add to MetaCart
The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic secondorder logic is recognizable, but not vice versa. The monadic secondorder theory of a contextfree set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins an investigation of the monadic secondorder logic of graphs and of sets of graphs, using techniques from universal algebra, and the theory of formal languages. (By a graph, we mean a finite directed hyperedgelabelled hypergraph, equipped with a sequence of distinguished vertices.) A survey of this research can be found in Courcelle [ 111. An algebraic structure on the set of graphs (in the above sense) has been proposed by Bauderon and Courcelle [2,7]. The notion of a recognizable set of finite graphs follows, as an instance of the general notion of recognizability introduced by Mezei and Wright in [25]. A graph can also be considered as a logical structure of a certain type. Hence, properties of graphs can be written in firstorder logic or in secondorder logic. It turns out that monadic secondorder logic, where quantifications over sets of vertices and sets of edges are used, is a reasonably powerful logical language (in which many usual graph properties can be written), for which one can obtain decidability results. These decidability results do not hold for secondorder logic, where quantifications over binary relations can also be used. Our main theorem states that every definable set of finite graphs (i.e., every set that is the set of finite graphs satisfying a graph property expressible in monadic secondorder logic) is recognizable. * This work has been supported by the “Programme de Recherches Coordonntes: Mathematiques et Informatique.”
A Hidden Agenda
 Theoretical Computer Science
, 2000
"... This paper publicly reveals, motivates, and surveys the results of an ambitious hidden agenda for applying algebra to software engineering. The paper reviews selected literature, introduces a new perspective on nondeterminism, and features powerful hidden coinduction techniques for proving behaviora ..."
Abstract

Cited by 110 (23 self)
 Add to MetaCart
This paper publicly reveals, motivates, and surveys the results of an ambitious hidden agenda for applying algebra to software engineering. The paper reviews selected literature, introduces a new perspective on nondeterminism, and features powerful hidden coinduction techniques for proving behavioral properties of concurrent systems, especially renements; some proofs are given using OBJ3. We also discuss where modularization, bisimulation, transition systems and combinations of the object, logic, constraint and functional paradigms t into our hidden agenda. 1 Introduction Algebra can be useful in many dierent ways in software engineering, including specication, validation, language design, and underlying theory. Specication and validation can help in the practical production of reliable programs, advances in language design can help improve the state of the art, and theory can help with building new tools to increase automation, as well as with showing correctness of the whole e...
TRIPLES, ALGEBRAS AND COHOMOLOGY
 REPRINTS IN THEORY AND APPLICATIONS OF CATEGORIES
, 2003
"... ..."
EQUIVALENCES AND TRANSFORMATIONS OF REGULAR SYSTEMS  APPLICATIONS TO RECURSIVE PROGRAM SCHEMES AND GRAMMARS
, 1986
"... This work presents a unified theory of recursive program schemes, contextfree grammars, grammars on arbitrary algebraic structures and, in fact, recursive definitions of all kind by means of regular systems. The equivalences of regular systems associated with either all their solutions or their le ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
This work presents a unified theory of recursive program schemes, contextfree grammars, grammars on arbitrary algebraic structures and, in fact, recursive definitions of all kind by means of regular systems. The equivalences of regular systems associated with either all their solutions or their least solutions (in all domains of appropriate type satisfying a set of algebraic laws expressed by equations) are systematically investigated and characterized (in some cases) in terms of system transformations by folding, unfolding and rewriting according to the equational algebraic laws. Grammars are better characterized in terms of polynomial systems which are regular systems involving the operation of set union, and the same questions are raised for them. We also examine conditions insuring the uniqueness of the solution of a regular or of a polynomial system. This theory applies to grammars of many kinds which generate trees, graphs, etc. We formulate some classical transformations of contextfree grammars in terms of correct transformations which only use folding, unfolding and algebraic laws and we immediately obtain their correctness.
On logically defined recognizable tree languages
 In: Proc. FST TCS 2003
, 2003
"... Abstract. We provide an algebraic characterization of the expressive power of various naturally defined logics on finite trees. These logics are described in terms of Lindström quantifiers, and particular cases include firstorder logic and modular logic. The algebraic characterization we give is ex ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Abstract. We provide an algebraic characterization of the expressive power of various naturally defined logics on finite trees. These logics are described in terms of Lindström quantifiers, and particular cases include firstorder logic and modular logic. The algebraic characterization we give is expressed in terms of a new algebraic structure, finitary preclones, and uses a generalization of the block product operation. 1
Rationality in Algebras With a Series Operation
 Information and Computation
, 2000
"... . This paper considers languages in a free algebra which has a binary associative operation called the series product. We define automata operating in these algebras and rational expressions, and we show that their expressive powers coincide (a Kleene theorem). We also show that this expressive p ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
. This paper considers languages in a free algebra which has a binary associative operation called the series product. We define automata operating in these algebras and rational expressions, and we show that their expressive powers coincide (a Kleene theorem). We also show that this expressive power equals that of algebraic recognizability (a MyhillNerode theorem). This generalizes the work of Thatcher and Wright. The first equivalence continues to hold when conditions such as associativity and commutativity are imposed on the term operations, but recognizability is weaker when one of the term operations (other than the series product) is associative. We also consider languages which have a bound on the number of nested occurrences of certain designated term operations and get both the equivalences mentioned above. This generalizes our earlier work and answers a question left open therein. 1 Automata form one of the most commonly used computing device, from their histor...
A Functorial Semantics for MultiAlgebras and Partial Algebras, With Applications to Syntax
, 2000
"... Multialgebras allow for the modeling of nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a functorial presentation of various categories of multialgebras and partial algebras, analogous to the classica ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Multialgebras allow for the modeling of nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a functorial presentation of various categories of multialgebras and partial algebras, analogous to the classical presentation of algebras over a signature as cartesian functors from the algebraic theory over to Set. We introduce two dierent notions of theory over a signature, both having a structure weaker than cartesian, and we consider functors from them to Rel or Pfn, the categories of sets and relations or partial functions, respectively. Next we discuss how the functorial presentation provides guidelines for the choice of syntactical notions for a class of algebras, and as an application we argue that the natural generalization of usual terms are \conditioned terms" for partial algebras, and \term graphs" for multialgebras. Contents 1 Introduction 2 2 A short recap on multialgebras 4 3...
Universal regular path queries
 HigherOrder and Symbolic Computation
, 2003
"... Given are a directed edgelabelled graph G with a distinguished node n0, and a regular expression P which may contain variables. We wish to compute all substitutions φ (of symbols for variables), together with all nodes n such that all paths n0 → n are in φ(P). We derive an algorithm for this proble ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Given are a directed edgelabelled graph G with a distinguished node n0, and a regular expression P which may contain variables. We wish to compute all substitutions φ (of symbols for variables), together with all nodes n such that all paths n0 → n are in φ(P). We derive an algorithm for this problem using relational algebra, and show how it may be implemented in Prolog. The motivation for the problem derives from a declarative framework for specifying compiler optimisations. 1 Bob Paige and IFIP WG 2.1 Bob Paige was a longstanding member of IFIP Working Group 2.1 on Algorithmic Languages and Calculi. In recent years, the main aim of this group has been to investigate the derivation of algorithms from specifications by program transformation. Already in the mideighties, Bob was way ahead of the pack: instead of applying transformational techniques to wellworn examples, he was applying his theories of program transformation to new problems, and discovering new algorithms [16, 48, 52]. The secret of his success lay partly in his insistence on the study of general algorithm design strategies (in particular
Categories of Relational Structures
, 1998
"... . The paper characterises compositional homomorphims of relational structures. A detailed study of three categories of such structures  viewed as multialgebras  reveals the one with the most desirable properties. In addition, we study analogous categories with homomorphisms mapping elements to s ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
. The paper characterises compositional homomorphims of relational structures. A detailed study of three categories of such structures  viewed as multialgebras  reveals the one with the most desirable properties. In addition, we study analogous categories with homomorphisms mapping elements to sets (thus being relations). Finally, we indicate some consequences of our results for partial algebras which are special case of multialgebras. 1 Introduction In the study of universal algebra, the central place occupies the pair of "dual" notions of congruence and homomorphism: every congruence on an algebra induces a homomorphism into a quotient and every homomorphism induces a congruence on the source algebra. Categorical approach attempts to express all (internal) properties of algebras in (external) terms of homomorphisms. When passing to relational structures, however, the close correspondence of these internal and external aspects seems to get lost. The most common, and natural, gene...
Solving Optimisation Problems with Catamorphisms
, 1992
"... . This paper contributes to an ongoing effort to construct a calculus for deriving programs for optimisation problems. The calculus is built around the notion of initial data types and catamorphisms which are homomorphisms on initial data types. It is shown how certain optimisation problems, which a ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
. This paper contributes to an ongoing effort to construct a calculus for deriving programs for optimisation problems. The calculus is built around the notion of initial data types and catamorphisms which are homomorphisms on initial data types. It is shown how certain optimisation problems, which are specified in terms of a relational catamorphism, can be solved by means of a functional catamorphism. The result is illustrated with a derivation of Kruskal's algorithm for finding a minimum spanning tree in a connected graph. 1 Introduction Efficient algorithms for solving optimisation problems can sometimes be expressed as homomorphisms on initial data types. Such homomorphisms, which correspond to the familiar fold operators in functional programming, are called catamorphisms. In this paper, we give conditions under which an optimisation problem can be solved by a catamorphism. Our results are a natural generalisation of earlier work by Jeuring [5, 6], who considered the same problem ...