Filters








3,472 Hits in 2.8 sec

On the Context-Freeness Problem for Vector Addition Systems

Jerome Leroux, Vincent Penelle, Gregoire Sutre
2013 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science  
Petri nets, or equivalently vector addition systems (VAS), are widely recognized as a central model for concurrent systems.  ...  In this paper, we revisit the context-freeness problem for VAS, and give a simpler proof of decidability.  ...  ACKNOWLEDGMENT The authors thank Alain Finkel for fruitful discussions. This work was supported by the ANR project REACHARD (ANR-11-BS02-001).  ... 
doi:10.1109/lics.2013.9 dblp:conf/lics/LerouxPS13 fatcat:4ian5l23inhena4wrwmy7xs6iq

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems [chapter]

Jérôme Leroux, Vincent Penelle, Grégoire Sutre
2014 Lecture Notes in Computer Science  
Then, we apply our techniques to the context-freeness problem for flat counter systems, that asks whether the trace language of a counter system intersected with a bounded regular language is context-free  ...  For instance, bounded context-free languages are used to under-approximate the behaviors of recursive programs.  ...  The context-freeness problem for counter systems asks whether the trace language of a given counter system is context-free.  ... 
doi:10.1007/978-3-319-11936-6_19 fatcat:6ozev4qslza6jkt7ikcgb26ewe

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness [chapter]

Jérôme Leroux, M. Praveen, Grégoire Sutre
2013 Lecture Notes in Computer Science  
Introduction Vector addition systems (VAS), or equivalently Petri nets, are well-studied for the modeling and analysis of concurrent systems.  ...  We introduce a logic for specifying trace properties of vector addition systems (VAS). This logic can express linear relations among pumping segments occurring in a trace.  ...  However, without these words, the reachability problem for vector addition systems can be easily reduced to the model-checking problem for the logic.  ... 
doi:10.1007/978-3-642-40184-8_11 fatcat:g4y2h5iuxvgd7ohsta5tcwva4y

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming [article]

Robert Bredereck, Andrzej Kaczmarczyk, Dušan Knop, Rolf Niedermeier
2020 arXiv   pre-print
Therein, answering an open question from previous work, we proved that the problem of finding envy-free Pareto-efficient allocations of indivisible items is fixed-parameter tractable with respect to the  ...  Using insights from parametric integer linear programming, we significantly improve on our previous work [Proc. ACM EC 2019] on high-multiplicity fair allocation.  ...  For instance, Lipton et al. [24] considered the concept of envy-freeness up to one good (EF1).  ... 
arXiv:2005.04907v1 fatcat:6wmocjeonzh63f3hdwdykfq6oi

Separations of Matroid Freeness Properties [article]

Arnab Bhattacharyya and Elena Grigorescu and Jakob Nordström and Ning Xie
2010 arXiv   pre-print
We shed light on this problem by developing a method for determining the relation between two matroid freeness properties P and Q.  ...  Properties of Boolean functions on the hypercube invariant with respect to linear transformations of the domain are among the most well-studied properties in the context of property testing.  ...  Acknowledgments We are grateful to Madhu Sudan for suggesting that we investigate the problems studied in this work, for giving many helpful insights and comments along the way, and for challenging us  ... 
arXiv:1008.4401v2 fatcat:y4dflcpnbjez3ponh5t2tynzpy

Context-Freeness of Word-MIX Languages [chapter]

Ryoma Sin'Ya
2020 Lecture Notes in Computer Science  
In this paper we provide a decidable characterisation of the context-freeness of a Word-MIX language LA(w1, . . . , w k ), where LA(w1, . . . , w k ) is the set of all words over A that contain the same  ...  The author would like to thank Thomas Finn Lidbetter for telling me this topic in DLT 2018.  ...  The author also thank to anonymous reviewers for many valuable comments. This work was supported by JSPS KAKENHI Grant Number JP19K14582.  ... 
doi:10.1007/978-3-030-48516-0_23 fatcat:yyguxwe7sna4bg6qnfmqr6bvna

Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication [article]

Hu Fu, Robert Kleinberg
2013 arXiv   pre-print
Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing.  ...  A lower bound of (1 / ϵ)^2.423 for any one-sided tester was given by Bhattacharyya and Xie (2010). In this work we improve this bound to (1 / ϵ)^6.619.  ...  triangles in the system, one has to remove at least the same number of vectors.  ... 
arXiv:1308.1643v1 fatcat:svuxaer4qvbffmajvymp4p6kqq

Expectation Propagation for Approximate Inference: Free Probability Framework [article]

Burak Çakmak, Manfred Opper
2018 arXiv   pre-print
We demonstrate the relevance of our approach on the gene selection problem of a microarray dataset.  ...  of asymptotic freeness.  ...  Hernández-Lobato for discussions on real data application of our approach and providing the microarray datasets and the anonymous reviewers for their suggestions and comments.  ... 
arXiv:1801.05411v2 fatcat:bvizuem7zvepdetb233nsxx4fy

Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication

Hu Fu, Robert Kleinberg, Marc Herbstritt
2014 International Workshop on Approximation Algorithms for Combinatorial Optimization  
Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing.  ...  Triangle-freeness in Boolean functions is a simple property whose testing complexity is unknown.  ...  triangles in the system, one has to remove at least the same number of vectors.  ... 
doi:10.4230/lipics.approx-random.2014.669 dblp:conf/approx/FuK14 fatcat:ecmrth5wlrd4lfawhzc6ahjmee

Combinatorial data of a free arrangement and the Terao conjecture [article]

Tran Quoc Cong
2017 arXiv   pre-print
This structure permits us to detect the relationship between the combinatorial determined property and the singularity of vector field.  ...  Consequently, by using only combinatorial data, we have a basis of the module in free case and that yields a proof for the Terao's conjecture.  ...  In free arrangement context, there is a central problem is that called Terao conjecture, which asserts the freeness of A depends only on the combinatorics of the arrangement.  ... 
arXiv:1307.3750v3 fatcat:b72dyckq4zgf5jqeh2peawczti

Sunflowers and Testing Triangle-Freeness of Functions

Ishay Haviv, Ning Xie
2015 Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15  
We relate the problem to combinatorial questions on collections of vectors in Z n D and to sunflower conjectures studied by Alon, Shpilka, and Umans (Comput. Complex., 2013).  ...  In addition, we generalize the lower bound of Fu and Kleinberg to k-cycle-freeness for k ≥ 4 by generalizing the construction of uniquely solvable puzzles due to Coppersmith and Winograd (J.  ...  One-function As mentioned before, one might consider the one-function variant of the k-cycle-freeness testing problem.  ... 
doi:10.1145/2688073.2688084 dblp:conf/innovations/HavivX15 fatcat:y5rsspicbvfsvkiiiwz4cwiv7i

Sunflowers and Testing Triangle-Freeness of Functions [article]

Ishay Haviv, Ning Xie
2014 arXiv   pre-print
We relate the problem to combinatorial questions on collections of vectors in Z_D^n and to sunflower conjectures studied by Alon, Shpilka, and Umans (Comput. Complex., 2013).  ...  In addition, we generalize the lower bound of Fu and Kleinberg to k-cycle-freeness for k ≥ 4 by generalizing the construction of uniquely solvable puzzles due to Coppersmith and Winograd (J.  ...  One-function As mentioned before, one might consider the one-function variant of the k-cycle-freeness testing problem.  ... 
arXiv:1411.4692v1 fatcat:4wdkhyrh2fc5lpgtlh6x6fksbe

Sunflowers and Testing Triangle-Freeness of Functions

Ishay Haviv, Ning Xie
2016 Computational Complexity  
We relate the problem to combinatorial questions on collections of vectors in Z n D and to sunflower conjectures studied by Alon, Shpilka, and Umans (Comput. Complex., 2013).  ...  In addition, we generalize the lower bound of Fu and Kleinberg to k-cycle-freeness for k ≥ 4 by generalizing the construction of uniquely solvable puzzles due to Coppersmith and Winograd (J.  ...  One-function As mentioned before, one might consider the one-function variant of the k-cycle-freeness testing problem.  ... 
doi:10.1007/s00037-016-0138-7 fatcat:n46ciptgbjexddvivqepse4rqy

Solving the fair electric load shedding problem in developing countries

Olabambo Ifeoluwa Oluwasuji, Obaid Malik, Jie Zhang, Sarvapali Dyanand Ramchurn
2019 Autonomous Agents and Multi-Agent Systems  
Second, we model the FLSP as a resource allocation problem, which we formulate into two Mixed Integer Programming (MIP) problems based on the Multiple Knapsack Problem.  ...  In this paper, we solve the fair load shedding problem (FLSP) by creating solutions which connect households to supply based on some fairness criteria (i.e., to fairly connect homes to supply in terms  ...  Different resource allocation problems have been solved on electric grids using the multiagent system (MAS) approach.  ... 
doi:10.1007/s10458-019-09428-8 fatcat:lffkhg4lqvgcdayuhj5ohzzozq

On the computation of π-flat outputs for differential-delay systems [article]

F. Antritter and F. Cazaurang and J. Lévine and J. Middeke
2014 arXiv   pre-print
We introduce a new definition of π-flatness for linear differential delay systems with time-varying coefficients.  ...  We present an academic example of motion planning to discuss the pertinence of the approach.  ...  In both cases we will omit the indices when they are obvious from the context. We use O 1×m for the set of row vectors of length m and O n×1 for the set of column vectors of length n.  ... 
arXiv:1206.5872v2 fatcat:n3vnwmlzo5cy7fde7hdp4gbq64
« Previous Showing results 1 — 15 out of 3,472 results