Filters








830 Hits in 3.7 sec

Eliminating the storage tape in reachability constructions

Oscar H. Ibarra, Zhe Dang
2003 Theoretical Computer Science  
We also discuss the "boundedness problem" for reachability sets. Finally, we explain how the storage tape elimination technique can be applied to machines with real-valued clocks.  ...  We improve this result by showing that the stack can be eliminated from the acceptor, i.e., the binary reachability can be accepted by a two-tape ÿnite-state acceptor with reversal-bounded counters.  ...  In this paper, we improve the above results by showing that the pushdown stack can be eliminated from the acceptors.  ... 
doi:10.1016/s0304-3975(02)00545-5 fatcat:fymfxwgclbh33pxrz2t7eobiqy

Page 2425 of Mathematical Reviews Vol. , Issue 2004c [page]

2004 Mathematical Reviews  
1-WAS-CS; Pullman, WA) Eliminating the storage tape in reachability constructions.  ...  We improve this result by showing that the stack can be eliminated from the acceptor, i.e., that binary reach- ability can be accepted by a two-tape finite-state acceptor with reversal-bounded counters  ... 

Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines [article]

Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Průša
2021 arXiv   pre-print
Indeed, we study the costs of the conversions of nondeterministic finite automata into some variants of one-tape deterministic Turing machines working in linear time, namely Hennie machines, weight-reducing  ...  However the problem remains open in the general case, the best-known upper bound being exponential.  ...  In particular, the cost of the elimination of nondeterminism is a standard problem.  ... 
arXiv:2103.05485v2 fatcat:4ncbxsn2orhcdjaozumoprnpsi

Minimum-cost delegation in service composition

Cagdas E. Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su
2008 Theoretical Computer Science  
We also extend the framework to integrate activity processing costs into the delegation computation and to have services with bounded storage as opposed to finite storage.  ...  The paradigm of automated service composition through the integration of existing services promises a fast and efficient development of new services in cooperative service (e.g., business) environments  ...  Acknowledgements We are grateful to anonymous referees for their truly helpful comments that improve the presentation of our results.  ... 
doi:10.1016/j.tcs.2008.08.040 fatcat:atipe2dr2bfnbcblavzgmsx6te

Verification in loosely synchronous queue-connected discrete timed automata

Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro
2003 Theoretical Computer Science  
in half-duplex.  ...  There is no bound on the length of the queue. W and R do not share a global clock and operate in a loosely synchronous way.  ...  It follows from the constructions of A, B, and C above that we can e ectively construct, given a QTA M , a 2-tape PCA M accepting R(M ).  ... 
doi:10.1016/s0304-3975(02)00076-2 fatcat:pxqdi4dkz5e77nlqkoqcnjxo4e

Synthesis of Succinct Systems [article]

John Fearnley, Doron Peled, Sven Schewe
2012 arXiv   pre-print
However, an argument against it is that the temporal specification is highly compact, and the complexity reflects the large size of the system constructed.  ...  with measuring the system in terms of the explicit state space.  ...  position of the storage tape head, σ I is the symbol at the head of the input tape, σ O is the last symbol written to the output tape, and T is the current state of the storage tape.  ... 
arXiv:1202.5449v2 fatcat:3wby2drkjrhhljfjeqpe3ezbqm

A Perfect Model for Bounded Verification

Javier Esparza, Pierre Ganty, Rupak Majumdar
2012 2012 27th Annual IEEE Symposium on Logic in Computer Science  
In practice, verification problems for language classes that are not perfect are often under-approximated by checking if the property holds for all behaviors of the system belonging to a fixed subset.  ...  Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the language generated by the system is disjoint from the language of bad traces.  ...  In a second step we construct a PDA that recognizes interleavings of the different tapes in the order in which they are read by B.  ... 
doi:10.1109/lics.2012.39 dblp:conf/lics/EsparzaGM12 fatcat:3cra6notqrevncxwt5fmvh73ji

Substructural Proofs as Automata [chapter]

Henry DeYoung, Frank Pfenning
2016 Lecture Notes in Computer Science  
Constructions on finite state automata and transducers such as composition, complement, and inverse homomorphism can then be realized uniformly simply by cut and cut elimination.  ...  If we freely allow cuts in the proofs, they correspond to a well-typed class of machines we call linear communicating automata, which can also be seen as a generalization of Turing machines with multiple  ...  Turing machines are based on a finite set of states and an explicit storage medium (the tape) which can be read from, written to, and moved in small steps.  ... 
doi:10.1007/978-3-319-47958-3_1 fatcat:qf3q4jms4zaalaezcsinkkw6xq

Optimizing stream programs using linear state space analysis

Sitij Agrawal, William Thies, Saman Amarasinghe
2005 Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems - CASES '05  
Using the state space representation, we describe a novel set of program transformations, including combination of adjacent filters, elimination of redundant states and reduction of the number of system  ...  At each time step, the filter produces some outputs that are a linear combination of the inputs and the state values; the state values are also updated in a linear fashion.  ...  The StreamIt project is supported by DARPA grants PCA-F29601-03-2-0065 and HPCA/PERCS-W0133890, NSF awards CNS-0305453 and EIA-0071841, and the MIT Oxygen Alliance.  ... 
doi:10.1145/1086297.1086315 dblp:conf/cases/AgrawalTA05 fatcat:kse6mgbh5bhhlk5w7c5ryqed5u

The complexity of type analysis of object oriented programs [chapter]

Joseph Gil, Alon Itai
1998 Lecture Notes in Computer Science  
In this work, we show that under similar conditions, the problem is P-SPACE complete, provided that the program is not recursive. In the presence of recursion, the problem becomes EXP-TIME complete.  ...  One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch.  ...  locations reachable from these are stored in the pushdown tape.  ... 
doi:10.1007/bfb0054109 fatcat:gsxedqxf4bhh5fjmdw3pfglfie

Alternation

Ashok K. Chandra, Dexter C. Kozen, Larry J. Stockmeyer
1981 Journal of the ACM  
Alternation is a generalization of nondeterminism in which existential and universal quantitiers can alternate during the course of a computation, whereas in a nondeterministic computation there are only  ...  Subrecursive quantifier hierarchies are defined in terms of time-or space-bounded alternating Tufing machines by bounding the number of alternations allowed during computations.  ...  The case of S(n) not tape-constructible is handled as in the proof of Theorem 3.2.  ... 
doi:10.1145/322234.322243 fatcat:k56iutr535e73m7isbgbqpwiuy

Bounded memory protocols

Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2014 Computer languages, systems & structures  
In particular, the known anomalies arise for bounded memory protocols, where although the total number of sessions is unbounded, there is only a bounded number of concurrent sessions and the honest participants  ...  This led us to the question of whether it is possible to infer an upper-bound on the memory required by the Dolev-Yao adversary to carry out an anomaly from the memory restrictions of the bounded protocol  ...  Nigam was partially supported by the Alexander von Humboldt Foundation and CNPq. Kanovich was partially supported by the EPSRC.  ... 
doi:10.1016/j.cl.2014.05.003 fatcat:tsydq6ohhzcnnncl25te5drp4i

Computation with finite stochastic chemical reaction networks

David Soloveichik, Matthew Cook, Erik Winfree, Jehoshua Bruck
2008 Natural Computing  
Strategies for incorporating logic in aqueous chemistry have focused primarily on implementing components, such as logic gates, that are composed into larger circuits, with each logic gate in the circuit  ...  In particular, the exact molecular counts of each molecular species present, is an intrinsically available form of information.  ...  We reduce the reachability question in SCRNs to the reachability question in Vector Addition Systems (VAS), a model of asynchronous parallel processes developed by Karp and Miller [35] .  ... 
doi:10.1007/s11047-008-9067-y fatcat:rzwzdszapzeppbtsekwe3l6m5u

Efficient distributed backup with delta compression

Randal C. Burns, Darrell D. E. Long
1997 Proceedings of the fifth workshop on I/O in parallel and distributed systems - IOPADS '97  
Inexpensive storage and more powerful processors have resulted in a proliferation of data that needs to be reliably backed up.  ...  storage.  ...  You who helped in the design and implementation of this system and to N. Pass, J. Menon, and R. Golding whose support and guidance are instrumental to the continuing success of our research.  ... 
doi:10.1145/266220.266223 dblp:conf/iopads/BurnsL97 fatcat:wj7ijf2g7nchrgmhjq2gmq4sm4

Bounded Context Switching for Valence Systems

Roland Meyer, Sebastian Muskalla, Georg Zetzsche, Michael Wagner
2018 International Conference on Concurrency Theory  
In addition, we exhibit a class of storage mechanisms for which BCS reachability belongs to P.  ...  The main finding is that reachability within a bounded number of context switches is in NP, independent of the memory (the graph monoid).  ...  Complexity for Fixed Graphs We have seen that reachability under bounded context switching can always be decided in NP, even if the graph describing the storage mechanism is part of the input.  ... 
doi:10.4230/lipics.concur.2018.12 dblp:conf/concur/MeyerMZ18 fatcat:lec5fwqg75bzppo5undww5qoei
« Previous Showing results 1 — 15 out of 830 results