Filters








40 Hits in 3.3 sec

Parity Games on Bounded Phase Multi-pushdown Systems [chapter]

Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan
2017 Lecture Notes in Computer Science  
In this paper we address the problem of solving parity games over the configuration graphs of bounded phase multi-pushdown systems.  ...  We also prove a non-elementary lower-bound, answering a question posed by A.Seth.  ...  The second contribution of the paper is to establish a non-elementary lower bound for the parity games on bounded-phase multi-pushdown systems, showing that this problem is inherently hard and that our  ... 
doi:10.1007/978-3-319-59647-1_21 fatcat:gyox52gcgng3nmi4f7gvhnlxqa

Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard [article]

Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan
2012 arXiv   pre-print
We show that parity games on MPDS under phase-bounding restriction is non-elementary.  ...  We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems.  ...  is bounded by a constant k) one can effectively analyze multi-pushdown systems.  ... 
arXiv:1205.6928v1 fatcat:enmt7wj6fjaoxlsh5q7vux66hm

Saturation algorithms for model-checking pushdown systems

Arnaud Carayol, Matthew Hague
2014 Electronic Proceedings in Theoretical Computer Science  
We present a survey of the saturation method for model-checking pushdown systems.  ...  Seth used saturation to show that parity games over phase-bounded higher-order pushdown systems (without collapse) are effectively solvable [42] .  ...  to the global reachability problem for phase bounded pushdown systems [43] .  ... 
doi:10.4204/eptcs.151.1 fatcat:546kymvwxnfgxikrpfr2ozl5ry

A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems [article]

Kshitij Bansal New York University, USA
2012 arXiv   pre-print
In this note, we provide complexity characterizations of model checking multi-pushdown systems.  ...  Multi-pushdown systems model recursive concurrent programs in which any sequential process has a finite control.  ...  Another work that is worth looking at is the one on games on multi-stack systems [23] where parity games on bounded multi-stack systems are shown decidable thanks to a new proof for the decidability  ... 
arXiv:1212.1485v1 fatcat:yn3yhhntwnbvhj22qiykealcwy

Round-Bounded Control of Parameterized Systems [chapter]

Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
2018 Lecture Notes in Computer Science  
Good algorithmic properties are recovered under round-bounded verification, which restricts the system behavior to a bounded number of round-robin schedules.  ...  In this paper, we extend this approach to a game-based setting.  ...  Upper bound Decidability of Control rb comes from decidability of games on phase-bounded multi-pushdown systems (short: multi-pushdown games), which were first studied in [29] and rely on the phase-bounded  ... 
doi:10.1007/978-3-030-01090-4_22 fatcat:n3nod5br3valbjprijxtst5zpy

Regularity Problems for Weak Pushdown ω-Automata and Games [chapter]

Christof Löding, Stefan Repke
2012 Lecture Notes in Computer Science  
We show that this problem is already undecidable for games defined by one-counter automata or visibly pushdown automata with a safety condition.  ...  We prove the decidability by a reduction to the corresponding problems for deterministic pushdown automata on finite words.  ...  on the regularity problem for pushdown games.  ... 
doi:10.1007/978-3-642-32589-2_66 fatcat:vgv56zhgpzdkridklhexppowg4

Module checking of pushdown multi-agent systems [article]

Laura Bozzelli, Aniello Murano, Adriano Peron
2021 arXiv   pre-print
In this paper, we investigate the module-checking problem of pushdown multi-agent systems (PMS) against ATL and ATL* specifications.  ...  On the other hand, we show that ATL* module-checking of PMS turns out to be 4EXPTIME-complete, hence exponentially harder than both CTL* pushdown module-checking and ATL* model-checking of PMS.  ...  More recent approaches to the verification of multi-component finite-state systems (multi-agent systems) are based on the game paradigm: the system is modeled by a multi-player finite-state concurrent  ... 
arXiv:2003.04728v2 fatcat:e25qvqzlybhglgqzllx657glgi

Ordered Tree-Pushdown Systems [article]

Lorenzo Clemente, Paweł Parys, Sylvain Salvati, Igor Walukiewicz
2015 arXiv   pre-print
machine, and ordered annotated multi-pushdown systems.  ...  As an application, we show that our simple model can encode several formalisms generalizing pushdown systems, such as ordered multi-pushdown systems, annotated higher-order pushdown systems, the Krivine  ...  There exist restrictions of multi-pushdown systems that we do not cover in this paper. Reachability games are decidable for phase-bounded multi-pushdown systems [26] .  ... 
arXiv:1510.03278v1 fatcat:suhrbg4iyfho7ajpj4sqo4num4

Saturation of Concurrent Collapsible Pushdown Systems

Matthew Hague, Marc Herbstritt
2013 Foundations of Software Technology and Theoretical Computer Science  
Here, we study ordered, phase-bounded and scope-bounded multi-stack collapsible pushdown systems using saturation techniques, showing decidability of control state reachability and giving a regular representation  ...  Reachability problems for multi-stack collapsible pushdown systems have been little studied.  ...  Work by Seth considers phase-bounding for CPDS without collapse [29] by reduction to a finite state parity game.  ... 
doi:10.4230/lipics.fsttcs.2013.313 dblp:conf/fsttcs/Hague13 fatcat:uft3k4zxpnftto2jc5yolpklgm

Constrained Dynamic Tree Networks [chapter]

Matthew Hague, Vincent Penelle
2018 Lecture Notes in Computer Science  
We generalise Constrained Dynamic Pushdown Networks, introduced by Bouajjani et al., to Constrained Dynamic Tree Networks. In this model, we have trees of processes which may monitor their children.  ...  This is an application of a technique first used for a saturation technique for solving parity games over pushdown systems [15] .  ...  as phase-bounded, ordered, and scope-bounding [12, 38] .  ... 
doi:10.1007/978-3-030-00250-3_4 fatcat:rwnnhcywlreb7ffocj6jjzbur4

Saturation of Concurrent Collapsible Pushdown Systems [article]

Matthew Hague
2013 arXiv   pre-print
Here, we study ordered, phase-bounded and scope-bounded multi-stack collapsible pushdown systems using saturation techniques, showing decidability of control state reachability and giving a regular representation  ...  Reachability problems for multi-stack collapsible pushdown systems have been little studied.  ...  Work by Seth considers phase-bounding for CPDS without collapse [27] by reduction to a finite state parity game.  ... 
arXiv:1310.2631v1 fatcat:rlzvvrdhbzboxjhex2egvmjpwe

Automata-based Quantitative Verification [article]

Suguman Bansal
2020 arXiv   pre-print
Most algorithms comprise of a structural phase which reasons about the structure of the quantitative system(s) using techniques from automata or graphs, and a numerical phase, which reasons about the quantitative  ...  Comparators enable automata-based methods in the numerical phase, hence eradicating the dependence on numerical methods.  ...  Here, the structural phase consists of the reduction from planning to the quantitative graph game, while the numerical phase consists of solving the min-max optimization on the game.  ... 
arXiv:2010.02055v1 fatcat:jynqpn2msrdi5j72t3fm6yuiti

Synchronization and Control of Quantitative Systems [article]

Simon Laursen
2016 Ph.d.-serien for Det Teknisk-Naturvidenskabelige Fakultet, Aalborg Universitet  
Formal methods, such as model checking, theorem proving and static analysis, are used to provide confidence in system models and designs, as it can assist in all phases of system development and testing  ...  In this thesis, we explore modeling formalisms for quantitative systems and systems with partial observability to determine their computational limitations and feasibility.  ...  The work presented here was carried out while the third author visited the Distributed and Embedded Systems Unit at Aalborg University and while the second author visited the Reactive Systems Group at  ... 
doi:10.5278/vbn.phd.engsci.00182 fatcat:kftiafaw4fhf5lyrvqha7vaoce

Subject index volumes 1–200

1999 Theoretical Computer Science  
, 1577,3406 games, 3844 memory-allocation game, 446 search game, 646 two-phases locking, 1100 two-player game of complete information, 1787games, 2 142 perfect information game, 3291 two-process algorithm  ...  , (one-way nondeterministic finite automaton), 9 17 1 -output slices, 846 l-parity reduction, 2219 l-pebble cyclic automata, 1032 l-reducible substitution graph, 863 l-retreat-bounded regular picture language  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Introduction to Hybrid Systems [chapter]

Michael S. Branicky
2005 Handbook of Networked and Embedded Control Systems  
These systems are driven on our streets, used in our factories, and flown in our skies; see Fig. 1 .  ...  Thus, such systems arise whenever one mixes logical decision making with the generation of continuous-valued control laws.  ...  Fig. 8 . 8 (left) Finite automaton for parity, (right) Example Mealy machine Fig. 9 . 9 Timed automata modeling (left) bounded response time, (right) a switch with delay Fig. 11 . 11 (left) A multi-rate  ... 
doi:10.1007/0-8176-4404-0_5 fatcat:dkmjh424mjdpjduo7pzq4k3e6e
« Previous Showing results 1 — 15 out of 40 results