Sciweavers

76
Voted
ENTCS
2002
105views more  ENTCS 2002»
15 years 18 days ago
Fixed points in digital topology (via Helly posets)
Abstract. We extend some of our previous results on fixed points of graph multifunctions to posets. The posets of most interest here are the (finite) Khalimsky spaces, in their spe...
Rueiher Tsaur, Michael B. Smyth
118
Voted
ENTCS
2002
144views more  ENTCS 2002»
15 years 18 days ago
Logics and Multi-agents: towards a new symbolic model of cognition
Abstract The last edition of CLIMA, held in 2001 in Paphos (Cyprus) ended with a panel session on the role of Computational Logic (CL) in Multi-Agent Systems (MAS). Two dimensions ...
Paolo Torroni
88
Voted
ENTCS
2002
91views more  ENTCS 2002»
15 years 18 days ago
Petri nets with causal time for system verification
We present a new approach to the modelling of time constrained systems. It is based on untimed high-level Petri nets using the concept of causal time. With this concept, the progr...
Cécile Bui Thanh, Hanna Klaudel, Franck Pom...
97
Voted
ENTCS
2002
99views more  ENTCS 2002»
15 years 18 days ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews
106
Voted
ENTCS
2002
111views more  ENTCS 2002»
15 years 18 days 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
143
Voted
ENTCS
2002
207views more  ENTCS 2002»
15 years 18 days ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
61
Voted
ENTCS
2002
89views more  ENTCS 2002»
15 years 18 days ago
Bounded Model Checking for Timed Automata
Maria Sorea
80
Voted
ENTCS
2002
84views more  ENTCS 2002»
15 years 18 days ago
Set Types and Applications
We present pmlB, a programming language that includes primitive sets and associated operations. The language is equipped with a precise type discipline that statically captures dy...
Christian Skalka, Scott F. Smith
82
Voted
ENTCS
2002
77views more  ENTCS 2002»
15 years 18 days ago
Syntactic Type Soundness for HM(X)
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
Christian Skalka, François Pottier
98
Voted
ENTCS
2002
97views more  ENTCS 2002»
15 years 18 days ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott