4 search results - page 1 / 1 » Bounded Underapproximations |
CAV
2010
Springer
13 years 8 months ago
2010
Springer
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L L which has the same...
IANDC
2010
13 years 3 months ago
2010
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit de...
FSTTCS
2003
Springer
13 years 10 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hy...