Filters








51 Hits in 4.7 sec

Minimization of Visibly Pushdown Automata Using Partial Max-SAT [chapter]

Matthias Heizmann, Christian Schilling, Daniel Tischner
2017 Lecture Notes in Computer Science  
We consider the problem of state-space reduction for nondeterministic weakly-hierarchical visibly pushdown automata (VPA).  ...  We encode the existence of such a relation as a Boolean partial maximum satisfiability (PMax-SAT) problem and present an algorithm that quickly finds satisfying assignments.  ...  Live visibly pushdown automata Let Q ⊥ def = Q ∪ {⊥} be the stack alphabet.  ... 
doi:10.1007/978-3-662-54577-5_27 fatcat:eu6vsqt45jhm3cunyu2vlaiooy

Minimization of visibly pushdown automata is NP-complete [article]

Olivier Gauwin, Anca Muscholl, Michael Raskin
2020 arXiv   pre-print
We show that the minimization of visibly pushdown automata is NP-complete.  ...  We show that minimizing immersions is NP-complete, and reduce this problem to the minimization of visibly pushdown automata.  ...  The paper [7] proposes an algorithm for computing locally minimal non-deterministic VPA, relying on a reduction to Partial Max-SAT.  ... 
arXiv:1907.09563v3 fatcat:pc2qng7m6rbhxn4ix5xxhkzjci

Minimization of visibly pushdown automata is NP-complete

Olivier Gauwin, Anca Muscholl, Michael Raskin
2019 Logical Methods in Computer Science  
We show that the minimization of visibly pushdown automata is NP-complete.  ...  We show that minimizing immersions is NP-complete, and reduce this problem to the minimization of visibly pushdown automata.  ...  The paper [7] proposes an algorithm for computing locally minimal non-deterministic VPA, relying on a reduction to Partial Max-SAT.  ... 
doi:10.23638/lmcs-16(1:14)2020 fatcat:trq4jgd6kza7zmv3hjbunytjfy

Pushdown module checking with imperfect information

Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre, Moshe Y. Vardi
2013 Information and Computation  
In this paper, we extend pushdown module checking to the imperfect information setting; i.e., to the case where the environment has only a partial view of the system's control states and pushdown store  ...  Indeed, we prove that with imperfect information about the control states, but a visible pushdown store, the problem is decidable and its complexity is 2Exptime-complete for CTL and the propositional µ-calculus  ...  Thus, is always present at the bottom of the pushdown store, and nowhere else. Note that we make this assumption also about the various pushdown automata we use later.  ... 
doi:10.1016/j.ic.2012.11.005 fatcat:vnjla5mqiffsbozq3dej7hcefa

Diagnosability of Pushdown Systems [chapter]

Christophe Morvan, Sophie Pinchinat
2011 Lecture Notes in Computer Science  
We investigate diagnosability for classes of pushdown systems: it is undecidable in general, but we exhibit reasonably large classes of visibly pushdown systems where the problem is decidable.  ...  In this context, the diagnosis of a discrete-event system consists in detecting defects from the (partial) observation of its executions.  ...  Also, SAT-solvers can be used for symbolic systems [9] .  ... 
doi:10.1007/978-3-642-19237-1_6 fatcat:ft6odzopa5dx3mlpbdzke6h7wa

Rigid tree automata and applications

Florent Jacquemard, Francis Klay, Camille Vacher
2011 Information and Computation  
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid.  ...  This result, one of the first on rewrite closure of languages of tree automata with constraints, is enabling the extension of model checking procedures based on finite tree automata techniques, in particular  ...  In [5] , Chabin and Rety show that the class of visibly pushdown tree automata (VPTA) languages is closed under rewriting with so called linear visibly context-free TRS.  ... 
doi:10.1016/j.ic.2010.11.015 fatcat:7bxtni3dizgqhn6dv26q4uobdi

Parity Games Played on Transition Graphs of One-Counter Processes [chapter]

Olivier Serre
2006 Lecture Notes in Computer Science  
Second, we show how these games can be used to solve pushdown games with winning conditions that are Boolean combinations of a parity condition on the control states with conditions on the stack height  ...  An important corollary of this result is that the µ-calculus model checking problem for pushdown processes is Exp-Time-complete.  ...  We briefly mention here an extension of our result. In [14] pushdown games equipped with visibly pushdown winning conditions were considered.  ... 
doi:10.1007/11690634_23 fatcat:tsip6s4xqfcevo3bt7x5joe2cq

Pushdown flow analysis with abstract garbage collection

J. IAN JOHNSON, ILYA SERGEY, CHRISTOPHER EARL, MATTHEW MIGHT, DAVID VAN HORN
2014 Journal of functional programming  
In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection push the boundaries of what we can learn about programs statically.  ...  Pushdown flow analysis grants unbounded yet computable polyvariance to the analysis of return-flow in higher-order programs.  ...  F ⊆ Q is a set of accepting states; and 4. γ ∈ Γ * is the initial stack. We use PDA to denote the class of all pushdown automata. Pushdown automata recognize languages over their input alphabet.  ... 
doi:10.1017/s0956796814000100 fatcat:wrkxdigcibdfdoy6i3axm6blhq

Learning Realtime One-Counter Automata [article]

Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
2021 arXiv   pre-print
We evaluate an implementation of our algorithm on a number of random benchmarks and on a use case regarding efficient JSON-stream validation.  ...  Our algorithm uses membership and equivalence queries as in Angluin's L* algorithm, as well as counter value queries and partial equivalence queries.  ...  This work was partially supported by the Belgian FWO "SAILor" project (G030020N). Gaëtan Staquet is a research fellow (Aspirant) of the Fonds de la Recherche Scientifique -FNRS.  ... 
arXiv:2110.09434v1 fatcat:u3xkhubex5hzfiydgo3k4fehkm

Regular Model Checking Revisited (Technical Report) [article]

Anthony W. Lin, Philipp Rümmer
2021 arXiv   pre-print
We argue that this is a natural formulation that enables us tap into powerful synthesis techniques that have been extensively studied in the software verification community.  ...  systems with an arbitrary number of processes).  ...  The SAT solver is first queried to produce a candidate automaton H that satisfies a partial encoding of ϕ.  ... 
arXiv:2005.00990v2 fatcat:kvmcpfh3x5actialupmareevru

Subject index volumes 1–200

1999 Theoretical Computer Science  
framework, 2001 unique maximal class, 2005 unique minimal, 2690 unique minimal solutions, 191 for recursive definitions, 191 unique multiset, 2136 solution, 2243 solution, SAT problems with -,  ...  -, 2771 with a bounded number of alternations. 3346 alternating two-way finite automata, 25 1 I tree automata, 825 alternating two-way pushdown tree automata, 825 alternation, 825, 840, 1790, 1802, 3417  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Bounded repairability for regular tree languages

Gabriele Puppis, Cristian Riveros, Sławek Staworko
2012 Proceedings of the 15th International Conference on Database Theory - ICDT '12  
tree languages (e.g., non-deterministic stepwise automata, deterministic stepwise automata, DTDs).  ...  We give effective characterizations of the pairs of specifications R and T for which such a uniform bound exists, and we study the complexity of the problem under different representations of the regular  ...  The third author has been partially supported by Ministry of Higher Education and Research, Nord-Pas de Calais Regional Council and FEDER through the Contrat de Projets Etat Region (CPER) 2007-2013, and  ... 
doi:10.1145/2274576.2274593 dblp:conf/icdt/PuppisRS12 fatcat:i53osvh6cvdr5ipeawy2imnr2i

MaxSAT Evaluation 2018: New Developments and Detailed Results

Fahiem Bacchus, Matti Järvisalo, Ruben Martins, Martina Seidl, Luca Pulina
2019 Journal on Satisfiability, Boolean Modeling and Computation  
This article provides an overview of the 2018 Max-SAT Evaluation, including a description of the main changes made in 2017 under a new organizing team, an overview of the solvers and benchmarks submitted  ...  The series of MaxSAT Evaluations, organized yearly since 2006, has been the main forum for evaluating the state of the art in solvers for the Boolean optimization paradigm of maximum satisfiability (MaxSAT  ...  These are a set of instances encoding the minimization of visibly pushdown automata.  ... 
doi:10.3233/sat190119 fatcat:bsua4twdkjfcpgdqiv2zddikom

Languages, Automata, and Logic [chapter]

Wolfgang Thomas
1997 Handbook of Formal Languages  
This paper is a survey on logical aspects of nite automata.  ...  Central points are the connection between nite automata and monadic second-order logic, the Ehrenfeucht-Fra ss e technique in the context of formal language theory, nite automata on !  ...  Zielonka for sending me their as yet unpublished papers and useful hints. Constructive comments by A. Arnold, D. Caucal, B. Courcelle, N. Klarlund, I. Walukiewicz, and W.  ... 
doi:10.1007/978-3-642-59126-6_7 fatcat:3ak2gtvtvnbbffvgeniim7f3mi

Non-Sequential Theory of Distributed Systems [article]

Benedikt Bollig, Paul Gastin
2021 arXiv   pre-print
A distributed system, on the other hand, combines several (finite or recursive) processes, and will therefore be modeled as a collection of (finite or pushdown, respectively) automata.  ...  That is, an execution of a system is modeled as a partial order, or graph, rather than a sequence of events.  ...  We may use a reduction from the intersection-emptiness problem for two pushdown automata A 1 and A 2 .  ... 
arXiv:1904.06942v2 fatcat:zn2bjk363fcs7fmo7ytig4digm
« Previous Showing results 1 — 15 out of 51 results