Sciweavers

4353 search results - page 105 / 871
» Expressiveness of Process Algebras
Sort
View
JSC
2007
71views more  JSC 2007»
15 years 3 months ago
Rational invariants of a group action. Construction and rewriting
Geometric constructions applied to a rational action of an algebraic group lead to a new algorithm for computing rational invariants. A finite generating set of invariants appear...
Evelyne Hubert, Irina A. Kogan
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
15 years 10 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
ENTCS
2007
111views more  ENTCS 2007»
15 years 4 months ago
Reversibility and Models for Concurrency
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
Iain Phillips, Irek Ulidowski
ICASSP
2011
IEEE
14 years 7 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
AMAST
1998
Springer
15 years 8 months ago
Scheduling Algebra
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
Rob J. van Glabbeek, Peter Rittgen