64 search results - page 8 / 13 » Real-Counter Automata and Their Decision Problems |
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
LATA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
80
Voted
ACSD
2005
IEEE
15 years 3 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
CAV
1999
Springer
15 years 1 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...