Add to ORKGBinary multirelations have received attention in recent years as a semantic domain of nondeterministic programming languages. Also, it is known that binary multirelations provide a model of Parikh’s game logic. The iteration operator plays a central role in these programming languages and the logic, and it is natural that the iteration is ineterpreted as the reflexive transitive closure of a binary multirelation. We investigate constructions of the reflexive transitive closure among basic properties of up-closed binary multirelations
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
We present a number of alternative ways of handling transitive binary relations that commonly occur ...
Abstract. Computing transitive closures of integer relations is the key to find-ing precise invarian...
Binary multirelations have received attention in recent years as a semantic domain of nondeterminist...
Binary multirelations associate elements of a set with its subsets; hence they are binary relations ...
Concurrent games as event structures form a partial order model of concurrency where concurrent beha...
Abstract. We argue that the concept of transitive closure is the key for under-standing nitary induc...
A relation R on set A is an equivalence relation on A if and only if R is reflexive, symmetric and t...
We provide a generic work-list algorithm to compute the (reflexi-ve-)transitive closure of relations...
Rational relations are binary relations of finite words that are realised by non-deterministic finit...
We investigate the impact of using different algorithmic techniques and data representations in algo...
Binary relations are such a basic object that they appear in many places in mathematics and computer...
Based on a simple axiomatization of concurrent behaviour we define two ways of observing parallel co...
Rational relations are binary relations of finite words that are realised by non-deterministic finit...
We state Warshall's algorithm in an abstract form and prove its correctness, while postponing the ch...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
We present a number of alternative ways of handling transitive binary relations that commonly occur ...
Abstract. Computing transitive closures of integer relations is the key to find-ing precise invarian...
Binary multirelations have received attention in recent years as a semantic domain of nondeterminist...
Binary multirelations associate elements of a set with its subsets; hence they are binary relations ...
Concurrent games as event structures form a partial order model of concurrency where concurrent beha...
Abstract. We argue that the concept of transitive closure is the key for under-standing nitary induc...
A relation R on set A is an equivalence relation on A if and only if R is reflexive, symmetric and t...
We provide a generic work-list algorithm to compute the (reflexi-ve-)transitive closure of relations...
Rational relations are binary relations of finite words that are realised by non-deterministic finit...
We investigate the impact of using different algorithmic techniques and data representations in algo...
Binary relations are such a basic object that they appear in many places in mathematics and computer...
Based on a simple axiomatization of concurrent behaviour we define two ways of observing parallel co...
Rational relations are binary relations of finite words that are realised by non-deterministic finit...
We state Warshall's algorithm in an abstract form and prove its correctness, while postponing the ch...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
We present a number of alternative ways of handling transitive binary relations that commonly occur ...
Abstract. Computing transitive closures of integer relations is the key to find-ing precise invarian...