Sciweavers

110 search results - page 13 / 22
» Domains of Higher-Dimensional Automata
Sort
View
LICS
2002
IEEE
14 years 1 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
FCT
2007
Springer
14 years 16 days ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
Thomas Colcombet
VIS
2007
IEEE
123views Visualization» more  VIS 2007»
14 years 10 months ago
Multifield Visualization Using Local Statistical Complexity
Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be ext...
Heike Jänicke, Alexander Wiebel, Gerik Scheuerm...
AAAI
2010
13 years 10 months ago
Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs
Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advant...
Christopher Amato, Blai Bonet, Shlomo Zilberstein
ENTCS
2010
82views more  ENTCS 2010»
13 years 8 months ago
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
Philip Mayer, Andreas Schroeder, Sebastian S. Baue...