Results 1 
6 of
6
RelationAlgebraic Analysis of Petri Nets With RELVIEW
 In Proceedings of the 2nd Workshop on Tools and Applications for the Construction and Analysis of Systems (TACAS ’96), number 1055 in LNCS
, 1996
"... We present a method for specifying and implementing algorithms for the analysis of Petri nets. It is formally grounded in relational algebra. Specifications are written in ordinary predicate logic and then transformed systematically into relational programs which can be executed directly in RELVIEW, ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
We present a method for specifying and implementing algorithms for the analysis of Petri nets. It is formally grounded in relational algebra. Specifications are written in ordinary predicate logic and then transformed systematically into relational programs which can be executed directly in RELVIEW, a graphical computer system for calculating with relations. Our method yields programs that are correct by construction. Its simplicity and efficiency is illustrated in many examples. 1 Introduction Petri nets [9, 10] are widely used for designing and modeling concurrent and interacting processes. The success of Petri nets derives from their intuitive graphical representation which has great appeal even for people who are not familiar with the underlying theory. Furthermore, they have a welldefined semantics which unambiguously defines the behaviour of a net and allows formal analysis. And, finally, since they may contain cycles, a large class of processes can be represented by finite nets...
Causal Maps: Theory, Implementation, and Practical Applications in Multiagent Environments
, 2002
"... Analytical techniques are generally inadequate for dealing with causal interrelationships among a set of individual and social concepts. Usually, causal maps are used to cope with this type of interrelationships. However, the classical view of causal maps is based on an intuitive view with ad hoc ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Analytical techniques are generally inadequate for dealing with causal interrelationships among a set of individual and social concepts. Usually, causal maps are used to cope with this type of interrelationships. However, the classical view of causal maps is based on an intuitive view with ad hoc rules and no precise semantics of the primitive concepts, nor a sound formal treatment of relations between concepts. In this paper, we solve this problem by proposing a formal model for causal maps with a precise semantics based on relation algebra and the software tool, CMRELVIEW, in which it has been implemented. Then, we investigate the issue of using this tool in multiagent environments by explaining through different examples how and why this tool is useful for the following aspects: 1) the reasoning on agents' subjective views, 2) the qualitative distributed decision making, and 3) the organization of agents considered as a holistic approach. For each of these aspects, we focus on the computational mechanisms developed within CMRELVIEW to support it.
Grokking Software Architecture
"... This paper is a retrospective arising from a WCRE paper published in 1998 promoting a relational approach to manipulate software architecture and to help solve various problems in software analysis. That paper explains how Tarski’s binary relational algebra, embedded in a language such as Grok, can ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper is a retrospective arising from a WCRE paper published in 1998 promoting a relational approach to manipulate software architecture and to help solve various problems in software analysis. That paper explains how Tarski’s binary relational algebra, embedded in a language such as Grok, can solve such problems. Tarski’s notation is elegant and often efficiently executable when the subject at hand is characterized by parts with binary relations between them. Software architecture, especially asbuilt architecture, is such a subject. This paper concentrates on the following three questions. What impact can a relational approach have on our understanding of software architecture? What Groklanguages exist and what are their strengths? How have Groklike languages been used to solve problems in software architecture or software analysis?
RelationAlgebraic Derivation of Spanning Tree Algorithms
 Proc. MPC '98, LNCS 1422
, 1998
"... . We use Tarski's relational algebra to derive a series of algorithms for computing spanning trees of undirected graphs, including a variant of Prim's minimum spanning tree algorithm. 1 Introduction The relational calculus has been very successful in the derivation and proof of algorithms for direc ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. We use Tarski's relational algebra to derive a series of algorithms for computing spanning trees of undirected graphs, including a variant of Prim's minimum spanning tree algorithm. 1 Introduction The relational calculus has been very successful in the derivation and proof of algorithms for directed graphs. We claim that it is equally suitable for reasoning about undirected and even about weighted graphs. To prove our point we derive a series of increasingly powerful spanning tree algorithms which culminates in a variant of Prim's wellknown algorithm for computing a spanning tree with minimal weight. Directed graphs and relations are essentially the same, but there are (at least) two natural ways of representing undirected graphs as relations. The first possibility are symmetric relations on vertices, also known as adjacence relations. This representation has the advantage of simplicity; it is well suited for calculations. Alternatively we can use incidence relations between the se...
Prototyping Relational Specifications and Programs with RELVIEW
 Tool Support for System Development and Verification (proceedings). ShakerVerlag
, 1998
"... . Based on the representation of relations as Boolean matrices, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. Based on the representation of relations as Boolean matrices,
CMRelview: A Tool for Causal Reasoning in Multiagent Environments
"... this paper, we present a software tool called ########## based on relational algebra for dealing with such causal interrelationships. Then we investigate the issue of using this tool in multiagent environments, particularly in the case of: (1) the qualitative distributed decision making and, (2) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper, we present a software tool called ########## based on relational algebra for dealing with such causal interrelationships. Then we investigate the issue of using this tool in multiagent environments, particularly in the case of: (1) the qualitative distributed decision making and, (2) the organization of agents considered as a wholistic approach. For each of these aspects, we focus on the computational mechanisms developed within ### ####### to support it