Sciweavers

153 search results - page 14 / 31
» entcs 2002
Sort
View
85
Voted
ENTCS
2002
111views more  ENTCS 2002»
14 years 10 months ago
Comparing Meseguer's Rewriting Logic with the Logic CRWL
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino Tarjuelo
ENTCS
2002
121views more  ENTCS 2002»
14 years 10 months ago
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
Alexander Kurz, Jirí Rosický
ENTCS
2002
90views more  ENTCS 2002»
14 years 10 months ago
Specifying Graph-like Diagrams with DIAGEN
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...
Mark Minas
79
Voted
ENTCS
2002
95views more  ENTCS 2002»
14 years 10 months ago
Deriving Bisimulation Congruences: A 2-categorical Approach
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for p...
Vladimiro Sassone, Pawel Sobocinski
85
Voted
ENTCS
2002
103views more  ENTCS 2002»
14 years 10 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz