Filters








46 Hits in 3.1 sec

Decidability Results for the Boundedness Problem

Achim Blumensath, Martin Otto, Mark Weyer, Wolfgang Thomas
2014 Logical Methods in Computer Science  
This key result extends, by means of model-theoretic interpretations, to show decidability of the boundedness problem for MSO and guarded second-order logic (GSO) over the classes of structures of fixed  ...  Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the fixed-point recursion based on phi is spurious over the class of all trees in the sense that there is some uniform finite  ...  On the positive side, our present results bring this approach to fruition in the much wider and unifying setting of MSO.  ... 
doi:10.2168/lmcs-10(3:2)2014 fatcat:tze3aigqq5c7vgajlgjfrt3vuu

Boundedness of Monadic Second-Order Formulae over Finite Words [chapter]

Achim Blumensath, Martin Otto, Mark Weyer
2009 Lecture Notes in Computer Science  
The present investigation offers another step forward in the alternative approach to the boundedness problem, on a methodologically very different note, and -maybe the most important novel feature -in  ...  The hope is that this approach could go beyond an ad-hoc exposition of the decidability of the boundedness problem for individual syntactic fragments, and offer a unified model theoretic explanation instead  ...  keystone to this alternative approach to boundedness: Conjecture 1.  ... 
doi:10.1007/978-3-642-02930-1_6 fatcat:grebdsnhgjcxpnthtam2old5gq

Controlling a Random Population [chapter]

Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
2020 Lecture Notes in Computer Science  
a controller able to bring all agents to a target state?  ...  They showed that the problem is decidable and EXPTIME-complete in the adversarial setting, and posed as an open problem the stochastic setting, where the agent is represented by a Markov decision process  ...  We submitted this work to FoSSaCS for its excellence and because its location induces for us a low carbon footprint.  ... 
doi:10.1007/978-3-030-45231-5_7 fatcat:hamn6qpokvdmnm5vjrhdfgaaue

A Hierarchy of Implementable MSC Languages [chapter]

Benedikt Bollig, Martin Leucker
2005 Lecture Notes in Computer Science  
We develop a unifying theory of message-passing automata (MPAs) and MSC languages.  ...  We believe that it is possible to show incomparability respectively witnessed by a language depending on N and similar to the suggested one.  ...  the light-gray line in Figure 3 .  ... 
doi:10.1007/11562436_6 fatcat:lkhrp7cknnevposbmjhbahixny

Higher-Order Model Checking: An Overview

Luke Ong
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
This paper aims to give an overview of recent developments in higherorder model checking.  ...  Because the trees generated by recursion schemes are computation trees of higher-order functional programs, higherorder model checking provides a foundation for model checkers of such programming languages  ...  Acknowledgements: The author is grateful to Takeshi Tsukada for helpful comments on the paper.  ... 
doi:10.1109/lics.2015.9 dblp:conf/lics/Ong15 fatcat:55bfxqlkuzhbtgmzc32m46ooku

Width Parameters Beyond Tree-width and their Applications

P. Hlineny, S.-i. Oum, D. Seese, G. Gottlob
2007 Computer journal  
These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms.  ...  Our presented novel look at the contemporary developments of these 'width' parameters in combinatorial structures delivers-besides traditional tree-width and derived dynamic programming schemes-also a  ...  Dietrich, A. Mitschele and S. Seese for improving his German English, and J. Dermietzel for his help with generating some of the figures.  ... 
doi:10.1093/comjnl/bxm052 fatcat:n4nbasuvubc5lkajkskqk22fey

Synchronous Parallel Database Transformations [chapter]

Klaus-Dieter Schewe, Qing Wang
2012 Lecture Notes in Computer Science  
Database transformations provide a unifying umbrella for queries and updates.  ...  This defines a computational model for XML database transformation using a variant of Abstract State Machines.  ...  We approach this in two steps: first defining tree background classes that build upon the tree algebra and the weak MSO logic, and secondly adding tree type schemes to capture schema information.  ... 
doi:10.1007/978-3-642-28472-4_21 fatcat:2hjtynvwj5cdtpwqgdhpmrhowi

Clique-Width for Hereditary Graph Classes [article]

Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019 arXiv   pre-print
Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class G is bounded by a constant, a wide range of problems that  ...  are NP-complete in general can be shown to be polynomial-time solvable on G.  ...  Theorem 6.12 ([63]) Let H be a graph.  ... 
arXiv:1901.00335v2 fatcat:3mb44qloc5cxxddyimwo6horqa

Generalised Regular MSC Languages [chapter]

Benedikt Bollig, Martin Leucker, Thomas Noll
2002 Lecture Notes in Computer Science  
In contrast to existing work on regular MSC languages, our approach is neither restricted to a certain class of MSCs nor tailored to a fixed communication medium (such as a FIFO channel).  ...  To this aim, we formalise their behaviour by string languages and give a natural definition of regularity in terms of an appropriate Nerode right congruence.  ...  Furthermore, they are quite similar to the notion of sequence charts of the Unified Modelling Language (UML) [2] .  ... 
doi:10.1007/3-540-45931-6_5 fatcat:62ygf5guofevxinx4dzgnogjki

A Kleene theorem and model checking algorithms for existentially bounded communicating automata

Blaise Genest, Dietrich Kuske, Anca Muscholl
2006 Information and Computation  
The behavior of a network of communicating automata is called existentially bounded if communication events can be scheduled in such a way that the number of messages in transit is always bounded by a  ...  As a consequence, we give solutions in spirit of Madhusudan (2001) for various model checking problems on networks of communicating automata that satisfy our optimistic restriction.  ...  Without the restriction of universally bounded channels, [22, 23] shows how to use representative executions in model checking against MSO properties and [14] does this against MSC-graph properties  ... 
doi:10.1016/j.ic.2006.01.005 fatcat:5kn4xo6kxbhzfmuyjx6c3iad6m

A Step Up in Expressiveness of Decidable Fixpoint Logics

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
Here we show that one of the main restrictions imposed in the past can be lifted, getting a richer decidable logic by allowing fixpoints in which the parameters of the fixpoint can be unguarded.  ...  While guardedness has been applied fruitfully in the setting of first-order logic, the ability to add fixpoints while retaining decidability has been very limited.  ...  For cases without negation, like FO definability of C2RPQs, it may well be possible to extend the more elementary automata-theoretic approach used to decide boundedness for monadic Datalog [15] , avoiding  ... 
doi:10.1145/2933575.2933592 dblp:conf/lics/BenediktBB16 fatcat:iofilouplngydidnz42r5dkpt4

Event clock message passing automata: a logical characterization and an emptiness checking algorithm

S. Akshay, Benedikt Bollig, Paul Gastin
2012 Formal methods in system design  
We are interested in modeling behaviors and verifying properties of systems in which time and concurrency play a crucial role.  ...  We obtain such a constructive equivalence in two different ways: (1) by restricting the semantics by bounding the set of timed partial orders (2) by restricting the timed MSO logic to its existential fragment  ...  Acknowledgements We thank the anonymous referees for their constructive suggestions which helped in improving the presentation of the paper.  ... 
doi:10.1007/s10703-012-0179-8 fatcat:zfprunw7gncyjhikyslnbzlhse

Streaming Tree Transducers

Rajeev Alur, Loris D'antoni
2017 Journal of the ACM  
Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack  ...  Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack  ...  Acknowledgments: We thank Joost Engelfriet for his valuable feedback: not only he helped us navigate the extensive literature on tree transducers, but also provided detailed comments, including spotting bugs in  ... 
doi:10.1145/3092842 fatcat:hariawgsdbejlepopaarfwt5ju

Streaming Tree Transducers [chapter]

Rajeev Alur, Loris D'Antoni
2012 Lecture Notes in Computer Science  
Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack  ...  We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees (and hedges) in a single pass.  ...  Acknowledgments: We thank Joost Engelfriet for his valuable feedback: not only he helped us navigate the extensive literature on tree transducers, but also provided detailed comments, including spotting bugs in  ... 
doi:10.1007/978-3-642-31585-5_8 fatcat:kglsau2isveglpldahijjxmm3a

Streaming Tree Transducers [article]

Rajeev Alur, Loris D'Antoni
2012 arXiv   pre-print
Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack  ...  We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees in a single pass.  ...  Acknowledgments: We thank Joost Engelfriet for his valuable feedback: not only he helped us navigate the extensive literature on tree transducers, but also provided detailed comments, including spotting bugs in  ... 
arXiv:1104.2599v5 fatcat:nu733bj6t5fy3nwrc3cxpqcoie
« Previous Showing results 1 — 15 out of 46 results