𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decidability for branching time

✍ Scribed by John P. Burgess

Book ID
104744839
Publisher
Springer Netherlands
Year
1980
Tongue
English
Weight
1019 KB
Volume
39
Category
Article
ISSN
0039-3215

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Time–Space Tradeoffs for Branching Progr
Time–Space Tradeoffs for Branching Programs
✍ Paul Beame; T.S. Jayram; Michael Saks πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 265 KB

We obtain the first non-trivial time-space tradeoff lower bound for functions f: {0, 1} n Q {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1+e) n, for some constant e > 0. We also give the firs

Definability and decidability of binary
Definability and decidability of binary predicates for time granularity
✍ Massimo Franceschet; Angelo Montanari; Adriano Peron; Guido Sciavicco πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 288 KB

In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (respectively equi-column) predicate constraining two time points to belong to