Eliminating the storage tape in reachability constructions.
type: Item
instance of: scholarly article
title: Eliminating the storage tape in reachability constructions.
zbMATH Open document ID: 1042.68065
DOI: 10.1016/S0304-3975(02)00545-5
author: Oscar H. Ibarra
author: Zhe Dang
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1915590
zbMATH Keywords: Pushdown timed automaton
zbMATH Keywords: Reachability
zbMATH Keywords: Reversal-bounded counters
zbMATH Keywords: Presburger arithmetic
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
cites work: Verifying programs with unreliable channels
cites work: A theory of timed automata
cites work: Reachability analysis of pushdown automata: Application to model-checking
cites work: Q2753678
cites work: Q4551181
cites work: Q2754074
cites work: Q2762788
cites work: Q2754086
cites work: Q4501546
cites work: Q4223067
cites work: Bounded Algol-Like Languages
cites work: Q4535049
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: Q4536602
cites work: Verification in loosely synchronous queue-connected discrete timed automata.
cites work: Q4540965
cites work: Q4536378
cites work: Analysis of a class of communicating finite state machines
cites work: Boundedness, empty channel detection, and synchronization for communicating finite automata
full work available at URL: s0304-3975(02)00545-5
OpenAlex ID: W2015155803
description: scientific article; zbMATH DE number 1915590