Filters








211 Hits in 4.5 sec

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata [chapter]

Xiaojuan Cai, Mizuhito Ogawa
2014 Lecture Notes in Computer Science  
As an instance, an alternative proof of the decidability of the reachability for dense-timed pushdown system (in P.A. Abdulla, M.F. Atig, F.  ...  Stenman, Dense-Timed Pushdown Automata, IEEE LICS 2012 ) is presented. Our proof would be more robust for extensions, e.g., regular valuations with time.  ...  Dense-Timed Pushdown Automata Dense-timed pushdown automaton (DTPDA) extends timed pushdown automaton (TPDA) with local ages [2] .  ... 
doi:10.1007/978-3-319-07151-0_21 fatcat:mg3pkutpxrhh3jnl6pqmm34ilm

Revisiting Underapproximate Reachability for Multipushdown Systems [chapter]

S. Akshay, Paul Gastin, S Krishna, Sparsa Roychowdhury
2020 Lecture Notes in Computer Science  
In this paper, we propose a new class of bounded underapproximations for multi-pushdown systems, which subsumes most existing classes.  ...  To show the versatility of our approach, we then extend our algorithm to the timed setting and provide the first implementation that can handle timed multipushdown automata with closed guards.  ...  Adding real-time information to pushdown automata by using clocks or timed stacks has been considered, both in the discrete and dense-timed settings.  ... 
doi:10.1007/978-3-030-45190-5_21 fatcat:vxpjfdfbvja3xnd54mkfkcajj4

Reachability analysis of first-order definable pushdown systems [article]

Lorenzo Clemente, Sławomir Lasota
2015 arXiv   pre-print
We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure.  ...  We show that the reachability analysis can be addressed with the well-known saturation technique for the wide class of oligomorphic structures.  ...  This paper can be seen as such a case study for the specific case of pushdown automata.  ... 
arXiv:1504.02651v2 fatcat:sq2lqypu3rekhizrbsw223wop4

A Logical Characterization for Dense-Time Visibly Pushdown Automata [chapter]

Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi
2016 Lecture Notes in Computer Science  
dense-timed visibly pushdown automata specification.  ...  In this work we combine and extend these two works to introduce dense-time visibly pushdown automata that make both the call-return as well as resets visible.  ...  In this paper we present dense-time visibly pushdown automata (dtVPA) that form a subclass of dense-time pushdown automata of Abdulla, Atig, and Stenman [1] and generalize both visibly pushdown automata  ... 
doi:10.1007/978-3-319-30000-9_7 fatcat:e5a345g5fbbapkyriexzp2wnke

Pushdown timed automata: a binary reachability characterization and safety verification

Zhe Dang
2003 Theoretical Computer Science  
We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a state, dense clock values and a stack word.  ...  The properties previously could not be verified using the classic region technique nor expressed by timed temporal logics for timed automata and CTL¡ for pushdown systems.  ...  -With both dense clocks and the pushdown stack, this property can not be verified by using the region-based techniques for Timed Pushdown Systems [10] .  ... 
doi:10.1016/s0304-3975(02)00743-0 fatcat:b7yjrvzgibhdlmjd5tmjzpy26u

Timed pushdown automata and branching vector addition systems

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
2017 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
, recursive timed automata (RTA) [4] , [19] , densetimed pushdown automata (dtPDA) [1] , and timed register pushdown automata (trPDA) [9] .  ...  Motivated by verification of programs with both procedural and timed features, several extensions of timed automata by a pushdown stack have been proposed, including pushdown timed automata (PDTA) [6]  ... 
doi:10.1109/lics.2017.8005083 dblp:conf/lics/ClementeLLM17 fatcat:mvqnszkv6vh7bcgmx6xdqayepy

Revisiting Underapproximate Reachability for Multipushdown Systems [article]

S. Akshay, Paul Gastin, S Krishna, Sparsa Roychowdhury
2020 arXiv   pre-print
To show the versatility of our approach, we then extend our algorithm to the timed setting and provide the first implementation that can handle timed multi-pushdown automata with closed guards.  ...  In this paper, we propose a new class of bounded under approximations for multi-pushdown systems, which subsumes most existing classes.  ...  The case of a timed pushdown system with a single stack is similar to the case of timed automata, except for the fact that a discrete transition may involve push/pop operations.  ... 
arXiv:2002.05950v2 fatcat:tgrdgpndrvferll4ul7tl2eo64

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems

Lorenzo Clemente, Sławomir Lasota, Ranko Lazić, Filip Mazowiecki
2019 ACM Transactions on Computational Logic  
They strictly subsume pushdown timed automata of Bouajjani et al., dense-timed pushdown automata of Abdulla et al., and orbit-finite timed register pushdown automata of Clemente and Lasota.  ...  Timed-register pushdown automata constitute a very expressive class of automata, whose transitions may involve state, input, and top-of-stack timed-registers with unbounded differences.  ...  This structure is rich enough to model dense time for timed automata [9] and timed pushdown automata [13] .  ... 
doi:10.1145/3326161 fatcat:ykcup55zvbegxdgpkvkzmolk4u

Page 1305 of Mathematical Reviews Vol. , Issue 2002B [page]

2002 Mathematical Reviews  
As a particular case, the stack language of a pushdown automaton is regular.  ...  Summary: “Well-structured transition systems (WSTSs) are a gen- eral class of infinite-state systems for which decidability results rely on the existence of a well-quasi-ordering between states that is  ... 

Analyzing Timed Systems Using Tree Automata [article]

S. Akshay, Paul Gastin, Shankara Narayanan Krishna
2017 arXiv   pre-print
We propose a new technique to analyze such timed systems using finite tree automata instead of finite word automata.  ...  Further, we also demonstrate how we can use it on timed automata and timed multi-stack pushdown systems (with boundedness restrictions).  ...  Dense time multi-stack pushdown systems As another application of our technique, we now consider the model of dense-timed multistack pushdown automata (dtMPDA), which have several stacks.  ... 
arXiv:1604.08443v3 fatcat:hsgq6ornprah3hl6h34jac65aa

Page 2784 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
We show this result by reducing this problem to the emptiness problem of timed tree automata, so strengthening the already well-founded connections between finite automata and temporal logics.”  ...  The satisfiability of TCTL-formulae is undecidable even if the structures are restricted to dense trees obtained from timed graphs.  ... 

Real-Counter Automata and Their Decision Problems [chapter]

Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
2004 Lecture Notes in Computer Science  
We study the membership and emptiness problems for one-way/twoway real-counter automata as well as those automata further augmented with other unbounded storage devices such as integer-counters and pushdown  ...  In contrast to traditional word automata that accept sequences of symbols, real-counter automata accept real words that are bounded and closed real intervals delimited by a finite number of markers.  ...  The research of Zhe Dang and Gaoyan Xie was supported in part by NSF Grant CCF-0430531. The research of Oscar H.  ... 
doi:10.1007/978-3-540-30538-5_17 fatcat:eatrzzvcmvdopkcxz7odbcorom

Invisible formal methods for embedded control systems

A. Tiwari, N. Shankar, J. Rushby
2003 Proceedings of the IEEE  
The abstract system is sound with respect to the formal semantics of hybrid automata. We also discuss techniques for performing analysis on non-standard semantics of hybrid automata.  ...  Our approach is based on symbolic representation of the state space of the system using mathematical formulas in an appropriate logic.  ...  The class of o-minimal structures over the reals includes structures with richer signatures as well.  ... 
doi:10.1109/jproc.2002.805818 fatcat:g4bd5tlm5femvcvi7vooz7srnu

Faster Algorithms for Weighted Recursive State Machines [chapter]

Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis
2017 Lecture Notes in Computer Science  
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis.  ...  We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing  ...  systems [29, 26, 27, 23, 21] as well as related models of asynchronous pushdown networks [9] .  ... 
doi:10.1007/978-3-662-54434-1_11 fatcat:m5do7fcslbbrbptcxcwrob452y

Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata [chapter]

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
2014 Lecture Notes in Computer Science  
We study priced dense-timed pushdown automata that are a generalization of the classic model of pushdown automata, in the sense that they operate on real-valued clocks, and that the stack symbols have  ...  We show that the optimal cost, i.e., the infimum of the costs of the set of runs reaching a given control state, is computable.  ...  The method of [2] cannot be extended to the dense time case. It is well-known that, in timed models, using discrete domains represents a substantial simplification compared to using dense time.  ... 
doi:10.1007/978-3-319-04921-2_5 fatcat:2xmr3whrxbfvrjpm3nhb6i4sta
« Previous Showing results 1 — 15 out of 211 results