Sciweavers

200 search results - page 17 / 40
» Symbolic Equivalences for Open Systems
Sort
View
ICALP
2004
Springer
14 years 1 months ago
Syntactic Control of Concurrency
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
FOSSACS
2011
Springer
12 years 11 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
ATAL
2005
Springer
14 years 1 months ago
Integrating a MAS and a Pandemonium: the open-source framework AKIRA
The open-source framework AKIRA integrates Multiagent and Pandemonium elements. We describe the main components of the framework, showing that the hybrid nature of the Agents, hav...
Giovanni Pezzulo, Gianguglielmo Calvi, Rino Falcon...
ICVS
2003
Springer
14 years 25 days ago
The Imalab Method for Vision Systems
We propose a method to construct computer vision systems using a workbench composed of a multi-faceted toolbox and a general purpose kernel. The toolbox is composed of an open set ...
Augustin Lux
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard