Search results for "Emptiness"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
71	Chao Wang 0001, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi	Compositional SCC Analysis for Language Emptiness.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	language emptiness, model checking, BDD, LTL, abstraction refinement
71	Fang Wang, Sofiène Tahar	Language emptiness checking using MDGs.	ACM Great Lakes Symposium on VLSI	2003	DBLP DOI BibTeX RDF	MDGs (multiway decision graphs), ROBDDs (reduced ordered binary decision diagrams), büchi automata, formal hardware verification, language emptiness checking, model checking
66	Micha Sharir, Hayim Shaul	Ray shooting amid balls, farthest point from a line, and range emptiness searching.	SODA	2005	DBLP BibTeX RDF
66	Jean-Michel Couvreur, Alexandre Duret-Lutz, Denis Poitrenaud	On-the-Fly Emptiness Checks for Generalized Büchi Automata.	SPIN	2005	DBLP DOI BibTeX RDF
57	Orna Kupferman, Moshe Y. Vardi	From Complementation to Certification.	TACAS	2004	DBLP DOI BibTeX RDF
55	Tony Tan	On Pebble Automata for Data Languages with Decidable Emptiness Problem.	MFCS	2009	DBLP DOI BibTeX RDF
55	Guangyuan Li	Checking Timed Büchi Automata Emptiness Using LU-Abstractions.	FORMATS	2009	DBLP DOI BibTeX RDF
55	Stavros Tripakis, Sergio Yovine, Ahmed Bouajjani	Checking Timed Büchi Automata Emptiness Efficiently.	Formal Methods Syst. Des.	2005	DBLP DOI BibTeX RDF	on-the fly verification, timed automata, symbolic model-checking, verification tools
50	Roderick Bloem, Harold N. Gabow, Fabio Somenzi	An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	language emptiness, Büchi automata, Streett automata, model checking, binary decision diagrams, depth-first search, breadth-first search, strongly connected components, symbolic algorithms
49	Jeff Erickson 0001	Better Lower Bounds for Halfspace Emptiness.	FOCS	1996	DBLP DOI BibTeX RDF	halfspace emptiness, query region, computational complexity, lower bounds, points, polyhedron, facets, partitioning algorithms, hyperplanes, polylogarithmic factors
45	Joe Hendrix, Hitoshi Ohsaki	Combining Equational Tree Automata over AC and ACI Theories.	RTA	2008	DBLP DOI BibTeX RDF
44	Souheib Baarir, Alexandre Duret-Lutz	Emptiness Check of Powerset Buchi Automata using Inclusion Tests.	ACSD	2007	DBLP DOI BibTeX RDF
44	Yige Li, Kanglin Xie, Tao Hao	Combining Couvreur's Algorithm with Bitstate-Hashing for Emptiness Check.	IMSCCS (2)	2006	DBLP DOI BibTeX RDF
44	Philippe Balbiani	Emptiness Relations in Property Systems.	RelMiCS	2001	DBLP DOI BibTeX RDF
44	Hubert Wagener	On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs.	CSL	1988	DBLP DOI BibTeX RDF
39	Pao-Ann Hsiung	Parallel Object-Oriented Synthesis Environment Based On Message-Passing.	TOOLS (27)	1998	DBLP DOI BibTeX RDF	Object-Oriented Synthesis, Emptiness, Message-Passing, Deadlock, Parallel Design
34	Slawomir Lasota 0001, Igor Walukiewicz	Alternating timed automata.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	emptyness problem, timed automata, Alternation
34	Lakshmi Manasa, Shankara Narayanan Krishna, Kumar Nagaraj	Updatable Timed Automata with Additive and Diagonal Constraints.	CiE	2008	DBLP DOI BibTeX RDF
34	Clare Dixon, Michael Fisher 0001, Boris Konev	Is There a Future for Deductive Temporal Verification?	TIME	2006	DBLP DOI BibTeX RDF	fragments of PTL, deductive verification, clausal temporal resolution, complexity
34	Kumar Neeraj Verma	Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.	RTA	2003	DBLP DOI BibTeX RDF
34	Jean-Marc Talbot	On the Alternation-Free Horn Mu-calculus.	LPAR	2000	DBLP DOI BibTeX RDF
34	Oscar H. Ibarra, Tao Jiang 0001, Nicholas Q. Trân, Hui Wang 0008	New Decidability Results Concerning Two-way Counter Machines and Applications.	ICALP	1993	DBLP DOI BibTeX RDF
32	Stavros Tripakis	Checking timed Büchi automata emptiness on simulation graphs.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	property-preserving abstractions, timed Büchi automata, model checking, Formal methods, specification languages
32	Alexandre Duret-Lutz, Denis Poitrenaud, Jean-Michel Couvreur	On-the-fly Emptiness Check of Transition-Based Streett Automata.	ATVA	2009	DBLP DOI BibTeX RDF
32	Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl	Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
32	Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin	On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.	LATIN	2008	DBLP DOI BibTeX RDF
32	Mika Hirvensalo	Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
32	Zeeshan Anwar, Frank P. Ferrie	Towards Robust Voxel-Coloring: Handling Camera Calibration Errors and Partial Emptiness of Surface Voxels.	ICPR (1)	2006	DBLP DOI BibTeX RDF
32	Heikki Tauriainen	Nested Emptiness Search for Generalized Büchi Automata.	ACSD	2004	DBLP DOI BibTeX RDF
32	Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun	On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.	ISAAC	2002	DBLP DOI BibTeX RDF
32	Chao Wang 0001, Gary D. Hachtel	Sharp Disjunctive Decomposition for Language Emptiness Checking.	FMCAD	2002	DBLP DOI BibTeX RDF
32	Rahul Bhotika, David J. Fleet, Kiriakos N. Kutulakos	A Probabilistic Theory of Occupancy and Emptiness.	ECCV (3)	2002	DBLP DOI BibTeX RDF
32	Chao Wang 0001, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi	Divide and Compose: SCC Refinement for Language Emptiness.	CONCUR	2001	DBLP DOI BibTeX RDF
32	Dietrich Kuske	Emptiness Is Decidable for Asynchronous Cellular Machines.	CONCUR	2000	DBLP DOI BibTeX RDF
32	John G. Thistle, Walter Murray Wonham	Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata.	CSL	1991	DBLP DOI BibTeX RDF
27	Jirí Síma, Jirí Wiedermann	Theory of Neuromata.	J. ACM	1998	DBLP DOI BibTeX RDF	emptiness problem, finite neural networks, string acceptors, regular expressions, descriptional complexity, Hopfield networks
23	ZhangBing Zhou, Sami Bhiri, Armin Haller, Hai Zhuge, Manfred Hauswirth	Assessment of Service Protocols Adaptability Using a Novel Path Computation Technique.	OTM Conferences (1)	2009	DBLP DOI BibTeX RDF
23	Christel Baier, Nathalie Bertrand 0001, Marcus Größer	On Decision Problems for Probabilistic Büchi Automata.	FoSSaCS	2008	DBLP DOI BibTeX RDF
23	Yakov Nekrich	Data Structures with Local Update Operations.	SWAT	2008	DBLP DOI BibTeX RDF
23	Mohab Safey El Din	Testing Sign Conditions on a Multivariate Polynomial and Applications.	Math. Comput. Sci.	2007	DBLP DOI BibTeX RDF	optimization, complexity, Polynomial systems, inequalities, real solutions
23	Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato	A Robust Class of Context-Sensitive Languages.	LICS	2007	DBLP DOI BibTeX RDF
23	Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin 0001	Tree Automata with Memory, Visibility and Structural Constraints.	FoSSaCS	2007	DBLP DOI BibTeX RDF
23	Dario Carotenuto, Aniello Murano, Adriano Peron	2-Visibly Pushdown Automata.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF
23	Yakov Nekrich	Orthogonal Range Searching in Linear and Almost-Linear Space.	WADS	2007	DBLP DOI BibTeX RDF
23	Mathias Péron, Nicolas Halbwachs	An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints.	VMCAI	2007	DBLP DOI BibTeX RDF	difference-bound matrices, disequalities, static analysis, alias analysis, abstract domains
23	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison	Satisfiability of a Spatial Logic with Tree Variables.	CSL	2007	DBLP DOI BibTeX RDF
23	Alain Frisch, Haruo Hosoya	Towards Practical Typechecking for Macro Tree Transducers.	DBPL	2007	DBLP DOI BibTeX RDF
23	Bendick Mahleko, Andreas Wombacher	Indexing Business Processes based on Annotated Finite State Automata.	ICWS	2006	DBLP DOI BibTeX RDF
23	Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan 0001	Propositional Tree Automata.	RTA	2006	DBLP DOI BibTeX RDF
23	Barbara Jobstmann, Roderick Bloem	Optimizations for LTL Synthesis.	FMCAD	2006	DBLP DOI BibTeX RDF
23	Slawomir Lasota 0001, Igor Walukiewicz	Alternating Timed Automata.	FoSSaCS	2005	DBLP DOI BibTeX RDF
23	Dang Van Hung, Bui Vu Anh	Model Checking Real-Time Component Based Systems with Blackbox Testing.	RTCSA	2005	DBLP DOI BibTeX RDF	Duration Automata, Real-time Systems, Automatic Verification, Component Software
23	Catalin Dima	Timed Shuffle Expressions.	CONCUR	2005	DBLP DOI BibTeX RDF
23	Lopamudra Choudhury, Mihir K. Chakraborty	On Extending Venn Diagram by Augmenting Names of Individuals.	Diagrams	2004	DBLP DOI BibTeX RDF
23	Salvatore La Torre, Aniello Murano	Reasoning About Co-Büchi Tree Automata.	ICTAC	2004	DBLP DOI BibTeX RDF
23	Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl	Counting in Trees for Free.	ICALP	2004	DBLP DOI BibTeX RDF
23	Jan Hladik, Ulrike Sattler	A Translation of Looping Alternating Automata into Description Logics.	CADE	2003	DBLP DOI BibTeX RDF
23	Hitoshi Ohsaki, Toshinori Takai	Decidability and Closure Properties of Equational Tree Languages.	RTA	2002	DBLP DOI BibTeX RDF
23	Salvatore La Torre, Aniello Murano, Margherita Napoli	Weak Muller Acceptance Conditions for Tree Automata.	VMCAI	2002	DBLP DOI BibTeX RDF
23	Daniel Kirsten	Alternating Tree Automata and Parity Games.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
23	Roderick Bloem, Harold N. Gabow, Fabio Somenzi	An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps.	FMCAD	2000	DBLP DOI BibTeX RDF
23	András Sebö	An Introduction to Empty Lattice Simplices.	IPCO	1999	DBLP DOI BibTeX RDF
23	Frank Neven	Extensions of Attribute Grammars for Structured Document Queries.	DBPL	1999	DBLP DOI BibTeX RDF
23	Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard	Pumping, Cleaning and Symbolic Constraints Solving.	ICALP	1994	DBLP DOI BibTeX RDF
23	Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis	Memory Efficient Algorithms for the Verification of Temporal Properties.	CAV	1990	DBLP DOI BibTeX RDF
23	Dainis Geidmanis	On Possibilities of One-Way Synchronized and Alternating Automata.	MFCS	1990	DBLP DOI BibTeX RDF
23	Sophie Tison	Fair Termination is Decidable for Ground Systems.	RTA	1989	DBLP DOI BibTeX RDF
21	Pantelis Andreou, Stavros Konstantinidis, Taylor J. Smith	Improved Randomized Approximation of Hard Universality and Emptiness Problems.	CoRR	2024	DBLP DOI BibTeX RDF
21	Olga Martynova 0001	Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs.	Inf. Comput.	2024	DBLP DOI BibTeX RDF
21	Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault	Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata.	CoRR	2023	DBLP DOI BibTeX RDF
21	Rodrigo Raya	The Complexity of Checking Non-Emptiness in Symbolic Tree Automata.	CoRR	2023	DBLP DOI BibTeX RDF
21	Jiuqiang Liu	Necessary and sufficient conditions for solutions of the Ky Fan minimax inequality and the non-emptiness of fuzzy cores in economies.	Fuzzy Sets Syst.	2023	DBLP DOI BibTeX RDF
21	Weihao Su, Rongchen Li, Chengyao Peng, Haiming Chen	Algorithms for Checking Intersection Non-emptiness of Regular Expressions.	ICTAC	2023	DBLP DOI BibTeX RDF
21	Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault	Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata.	CONCUR	2023	DBLP DOI BibTeX RDF
21	Jakub Michaliszyn, Jan Otop, Piotr Wieczorek	Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix.	CONCUR	2023	DBLP DOI BibTeX RDF
21	Arijit Bishnu, Arijit Ghosh, Gopinath Mishra	On the Complexity of Triangle Counting Using Emptiness Queries.	APPROX/RANDOM	2023	DBLP DOI BibTeX RDF
21	Olga Martynova 0001	Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs.	CoRR	2022	DBLP DOI BibTeX RDF
21	Jiuqiang Liu	Non-emptiness of the fuzzy core in a finite production economy with infinite-dimensional commodity space.	Fuzzy Sets Syst.	2022	DBLP DOI BibTeX RDF
21	Dominik Peteler, Karin Quaas	Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order.	MFCS	2022	DBLP DOI BibTeX RDF
21	Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz	Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics.	CONCUR	2022	DBLP DOI BibTeX RDF
21	Petra Wolf 0002	Generalized Synchronization and Intersection Non-Emptiness of Finite-State Automata.		2022	RDF
21	Laure Daviaud, Marcin Jurdzinski, Ranko Lazic 0001, Filip Mazowiecki, Guillermo A. Pérez 0001, James Worrell 0001	When are emptiness and containment decidable for probabilistic automata?	J. Comput. Syst. Sci.	2021	DBLP DOI BibTeX RDF
21	Bingchen Gong, Yinyu Nie, Yiqun Lin, Xiaoguang Han 0001, Yizhou Yu	ME-PCN: Point Completion Conditioned on Mask Emptiness.	CoRR	2021	DBLP BibTeX RDF
21	Henning Fernau, Stefan Hoffmann 0001, Michael Wehar	Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.	CoRR	2021	DBLP BibTeX RDF
21	Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann 0001, Markus Holzer 0001, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf 0002	On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.	CoRR	2021	DBLP BibTeX RDF
21	Georg Zetzsche	The emptiness problem for valence automata over graph monoids.	Inf. Comput.	2021	DBLP DOI BibTeX RDF
21	Bingchen Gong, Yinyu Nie, Yiqun Lin, Xiaoguang Han 0001, Yizhou Yu	ME-PCN: Point Completion Conditioned on Mask Emptiness.	ICCV	2021	DBLP DOI BibTeX RDF
21	Pavol Vargovcík, Lukás Holík	Simplifying Alternating Automata for Emptiness Testing.	APLAS	2021	DBLP DOI BibTeX RDF
21	Aaron Lye	Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete.	LATA	2021	DBLP DOI BibTeX RDF
21	Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann 0001, Markus Holzer 0001, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf 0002	On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.	FSTTCS	2021	DBLP DOI BibTeX RDF
21	Dominik Barth, Moritz Beck 0001, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau	Emptiness problems for integer circuits.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
21	Amar Isli	Buchi automata augmented with spatial constraints: simulating an alternating with a nondeterministic and deciding the emptiness problem for the latter.	CoRR	2020	DBLP BibTeX RDF
21	Simon Wimmer 0001, Frédéric Herbreteau, Jaco van de Pol	Certifying Emptiness of Timed Büchi Automata.	CoRR	2020	DBLP BibTeX RDF
21	Petra Wolf 0002, Henning Fernau	Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata.	CoRR	2020	DBLP BibTeX RDF
21	Achille Basile, Vincenzo Scalzo	Non-emptiness of the alpha-core: sufficient and necessary conditions.	Int. J. Game Theory	2020	DBLP DOI BibTeX RDF
21	Antti Kuusisto, Fabian Reiter	Emptiness problems for distributed automata.	Inf. Comput.	2020	DBLP DOI BibTeX RDF
21	Mateus de Oliveira Oliveira, Michael Wehar	On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection.	DLT	2020	DBLP DOI BibTeX RDF
21	Simon Wimmer 0001, Frédéric Herbreteau, Jaco van de Pol	Certifying Emptiness of Timed Büchi Automata.	FORMATS	2020	DBLP DOI BibTeX RDF
21	Petr Jancar, Jérôme Leroux, Grégoire Sutre	Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States.	Fundam. Informaticae	2019	DBLP DOI BibTeX RDF
21	Xiujun Wang, Zhi Liu 0002, Yan Gao, Xiao Zheng, Xianfu Chen, Celimuge Wu	Near-Optimal Data Structure for Approximate Range Emptiness Problem in Information-Centric Internet of Things.	IEEE Access	2019	DBLP DOI BibTeX RDF