Sciweavers

ENTCS
2002
120views more  ENTCS 2002»
13 years 11 months ago
Composition of Distributed Software with Algon - Concepts and Possibilities
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
Judith Bishop, Karen Renaud, Basil Worrall
ENTCS
2002
64views more  ENTCS 2002»
13 years 11 months ago
Liveness Checking as Safety Checking
Armin Biere, Cyrille Artho, Viktor Schuppan
ENTCS
2002
53views more  ENTCS 2002»
13 years 11 months ago
Requirements for a Practical Network Event Recognition Language
Karthikeyan Bhargavan, Carl A. Gunter
ENTCS
2002
66views more  ENTCS 2002»
13 years 11 months ago
Non Truth-Functional Many-Valuedness
Many-valued logics are standardly defined by logical matrices. They are truth-functional. In this paper non truth-functional many-valued semantics are presented, in a philosophica...
Jean-Yves Béziau
ENTCS
2002
64views more  ENTCS 2002»
13 years 11 months ago
Maximal Introspection of Agents
Thomas Bolander
ENTCS
2002
92views more  ENTCS 2002»
13 years 11 months ago
PLCTools: Graph Transformation Meets PLC Design
This paper presents PLCTools, a formal environment for designing and simulating programmable controllers. Control models are specified with IEC FBD (Function Block Diagram), and t...
Luciano Baresi, Marco Mauri, Mauro Pezzè
ENTCS
2002
115views more  ENTCS 2002»
13 years 11 months ago
Component-Based Applications: A Dynamic Reconfiguration Approach with Fault Tolerance Support
This paper presents a mechanism for dynamic reconfiguration of component-based applications and its fault tolerance strategy. The mechanism, named generic connector, allows compos...
Thaís Vasconcelos Batista, Milano Gadelha C...
ENTCS
2002
66views more  ENTCS 2002»
13 years 11 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel
ENTCS
2002
118views more  ENTCS 2002»
13 years 11 months ago
Rank 2 Types for Term Graph Rewriting
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
Steffen van Bakel