Results 1 
3 of
3
On the Structure of Highlevel Nets
 Helsinki University of Technology
, 1995
"... : The structure of Highlevel nets is studied from an algebraic and a logical point of view using Algebraic nets as an example. First the category of Algebraic nets is defined and the semantics given through an unfolding construction. Other kinds of Highlevel net formalisms are then presented. It is ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
: The structure of Highlevel nets is studied from an algebraic and a logical point of view using Algebraic nets as an example. First the category of Algebraic nets is defined and the semantics given through an unfolding construction. Other kinds of Highlevel net formalisms are then presented. It is shown that nets given in these formalisms can be transformed into equivalent Algebraic nets. Then the semantics of nets in terms of universal constructions is discussed. A definition of Algebraic nets in terms of structured transition systems is proposed. The semantics of the Algebraic net is then given as a free completion of this structured transition system to a category. As an alternative also a sheaf semantics of nets is examined. Here the semantics of the net arises as a limit of a diagram of sheaves. Next Algebraic nets are characterized as encodings of special morphisms called foldings. Each algebraic net gives rise to a surjective morphism between Petri nets and conversely each sur...
How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs
 In Proceedings of the 4th International Workshop on Conditional Term Rewriting Systems
, 1994
"... We prove constructively that the class of groundconfluent and decreasing conditional term rewriting systems (CTRSs) (without extra variables) coincides with the class of orthogonal and terminating, unconditional term rewriting systems (TRSs). TRSs being included in CTRSs, this result follows from a ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We prove constructively that the class of groundconfluent and decreasing conditional term rewriting systems (CTRSs) (without extra variables) coincides with the class of orthogonal and terminating, unconditional term rewriting systems (TRSs). TRSs being included in CTRSs, this result follows from a transformation from any groundconfluent and decreasing CTRS specifying a computable function f into a TRS with the mentioned properties for f . The generated TRS is ordersorted, but we outline a similar transformation yielding an unsorted TRS.