Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
MST
2006
129views more  MST 2006»
11 years 1 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
DEDS
2007
109views more  DEDS 2007»
11 years 1 months ago
Concurrent Secrets
— Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers ...
Eric Badouel, Marek A. Bednarczyk, Andrzej M. Borz...
IJAC
2008
84views more  IJAC 2008»
11 years 1 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
RP
2009
Springer
124views Control Systems» more  RP 2009»
11 years 8 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
books