Sciweavers

1399 search results - page 77 / 280
» Multi-party Finite Computations
Sort
View
CONCUR
2004
Springer
14 years 3 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
CDC
2009
IEEE
116views Control Systems» more  CDC 2009»
14 years 2 months ago
Translation control of a fleet circular formation of AUVs under finite communication range
— This work proposes a control algorithm to stabilize a circular formation of AUVs tracking a time-varying center. We also consider the problem of uniform distribution of all the...
Lara B. Arranz, Alexandre Seuret, Carlos Canudas d...
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
14 years 2 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
KR
2000
Springer
14 years 1 months ago
Satisfiability Algorithms and Finite Quantification
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
Matthew L. Ginsberg, Andrew J. Parkes
DLT
2007
13 years 11 months ago
State Complexity of Union and Intersection of Finite Languages
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
Yo-Sub Han, Kai Salomaa