Sciweavers

2586 search results - page 19 / 518
» Automatic Abstraction for Congruences
Sort
View
CSL
2001
Springer
15 years 2 months ago
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
Hitoshi Ohsaki
FORTE
1996
14 years 11 months ago
Applications of Fair Testing
In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speci cation and analysis of distributed systems. This pre-order com...
Ed Brinksma, Arend Rensink, Walter Vogler
ATVA
2010
Springer
135views Hardware» more  ATVA 2010»
14 years 10 months ago
Probabilistic Contracts for Component-Based Design
Abstract. We define a probabilistic contract framework for the construction of component-based embedded systems, based on the theory of Interactive Markov Chains. A contract specif...
Dana N. Xu, Gregor Gößler, Alain Giraul...
99
Voted
HAPTICS
2008
IEEE
14 years 9 months ago
Analyzing Perceptual Representations of Complex, Parametrically-Defined Shapes Using MDS
Abstract. In this study we show that humans are able to form a perceptual space from a complex, three-dimensional shape space that is highly congruent to the physical object space ...
Nina Gaißert, Christian Wallraven, Heinrich ...
ENTCS
2008
99views more  ENTCS 2008»
14 years 9 months ago
A Categorical Model of the Fusion Calculus
We provide a categorical presentation of the Fusion calculus. Working in a suitable category of presheaves, we describe the syntax as initial algebra of a signature endofunctor, a...
Marino Miculan