Thomas Schwentick, Thomas Zeume,
... order relation and some further unary relations is EXPSPACE-complete. Actually, EXPSPACE-completeness already holds for structures that do not ... induced successor relation. As a special case, the EXPSPACE upper bound applies to two-variable logic over ... successor relation on the data is decidable in EXPSPACE. As a complementing result, it is shown that ...
Tópico(s): Logic, programming, and type systems
2012 - Logical Methods in Computer Science e.V. | Logical Methods in Computer Science
Jerzy Marcinkowski, Tomasz Truderung,
... our problem with the Büchi automata technique, is EXPSPACE. This means that we identify a natural fragment ... second result we show that the problem is EXPSPACE-hard if the winning condition is from the ... use the Büchi automata technique to show an EXPSPACE algorithm deciding more general LTL(◊, ○, ⋀, ∨) games, but do ...
Tópico(s): semigroups and automata theory
2002 - Springer Science+Business Media | Lecture notes in computer science
Tomǎš Brázdil, Antonı́n Kučera, Oldřich Stražovský,
... ω-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that ... the logic PECTL* for pPDA is in 2-EXPSPACE, and model-checking the qualitative fragment of PCTL for pPDA is in 2-EXPSPACE. Furthermore, model-checking the qualitative fragment of PCTL ...
Tópico(s): Software Testing and Debugging Techniques
2005 - Springer Science+Business Media | Lecture notes in computer science
... finite concurrent systems through Linearizability is in $$\mathsf {EXPSPACE}$$ . However, there was still a complexity gap between ... obtain $$\mathsf {PSPACE}$$ lower bound and the $$\mathsf {EXPSPACE}$$ upper bound. We show in this paper that Linearizability is $$\mathsf {EXPSPACE}$$ -complete.
Tópico(s): semigroups and automata theory
2015 - Springer Science+Business Media | Lecture notes in computer science
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala,
... by and finished-by is provably intractable, being Expspace-hard.Such a lower bound immediately propagates to ... Halfway are the fragments AABBE and AAEBE, whose Expspace membership and Pspace hardness are already known.Here, we give an original proof of Expspace membership, that substantially simplifies the complexity of the ...
Tópico(s): Logic, programming, and type systems
2018 - Elsevier BV | Theoretical Computer Science
Mohamed Faouzi Atig, Peter Habermehl,
... nets and claims that its satisfiability problem is expspace-complete. In this paper, we show that in ... of formulas for which the satisfiability problem is expspace-complete by adapting his proof.
Tópico(s): Logic, Reasoning, and Knowledge
2009 - Springer Science+Business Media | Lecture notes in computer science
... that the satisfiability problem for our formulas is EXPSPACE complete. Since a wide range of Petri net ... Problems can be shown to be solvable in EXPSPACE.
Tópico(s): semigroups and automata theory
1992 - Elsevier BV | Information and Computation
... the satisfiability problem for GF+ $$ \overrightarrow {TG} $$ is EXPSPACE-complete. The lower bound, obtained for the monadic ...
Tópico(s): Algorithms and Data Compression
2002 - Springer Science+Business Media | Lecture notes in computer science
Antti Valmari, Antti Kervinen,
... This problem turns out to be PSPACE- or EXPSPACE complete, depending on the type of the parallel ... may raise the complexity of the problem to EXPSPACE-hard.
Tópico(s): Cellular Automata and Applications
2002 - Springer Science+Business Media | Lecture notes in computer science
... 797–808). We show that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the ... Moreover we prove that safe realizability is also EXPSPACE-complete for the larger class of globally-cooperative ...
Tópico(s): Petri Nets in System Modeling
2003 - Elsevier BV | Theoretical Computer Science
Junping Zhou, Ping Huang, Minghao Yin, Chunguang Zhou,
This paper explores the phase transitions of the EXPSPACE-complete problems, which mainly focus on the conformant ...
Tópico(s): Model-Driven Software Engineering Techniques
2010 - World Scientific | International Journal of Foundations of Computer Science
Mohamed Faouzi Atig, Peter Habermehl,
... nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in ... of formulas for which the satisfiability problem is EXPSPACE-complete by adapting his proof.
Tópico(s): Logic, Reasoning, and Knowledge
2011 - World Scientific | International Journal of Foundations of Computer Science
... are PSPACE-complete, while the complexities increase to EXPSPACE-complete in each of the extensions. Alternating Büchi ... the upper bounds, while reductions from PSPACE and EXPSPACE tiling problems provide the lower bounds.
Tópico(s): Model-Driven Software Engineering Techniques
2006 - Springer Science+Business Media | Lecture notes in computer science
Stéphane Demri, Ranko Lazić, David Nowak,
... provide complexity results when the domain is finite (ExpSpace-completeness) or when the formulae are flat in ... respect to some complexity class (mainly PSpace and ExpSpace).
Tópico(s): Logic, Reasoning, and Knowledge
2006 - Elsevier BV | Information and Computation
Paulo Mateus, Daowen Qiu, Lvzhou Li,
... a system of algebraic polynomial (in)equations. An EXPSPACE upper bound on the complexity of the minimization ... many generalized quantum automata is decidable and in EXPSPACE. Finally, we also solve an open problem concerning ...
Tópico(s): Computability, Logic, AI Algorithms
2012 - Elsevier BV | Information and Computation
Junping Zhou, Minghao Yin, Xiangtao Li, Wang Jinyan,
... paper further explores the phase transitions of the EXPSPACE-complete problems, focusing on the conformant plan modification. ...
Tópico(s): Constraint Satisfaction and Optimization
2012 - World Scientific | International Journal of Foundations of Computer Science
Leonid W. Dworzański, Irina A. Lomazova,
... two-level NP-nets [14]. Boundedness is in EXPSPACE and liveness is in EXPSPACE or worse for plain Petri nets [6]. However, ...
Tópico(s): Business Process Modeling and Analysis
2012 - IOS Press | Fundamenta Informaticae
Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki,
... the complexity of the strong satisfiability problem is EXPSPACE-complete. This means that strong satisfiability offers the ... we show that the strong satisfiability problem remains EXPSPACE-complete even when only formulae with a temporal ...
Tópico(s): Petri Nets in System Modeling
2013 - Institute of Electronics, Information and Communication Engineers | IEICE Transactions on Information and Systems
... complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity are known. ... reachability graph. We show that this problem is EXPSPACE-complete. As an application of the introduced materials ...
Tópico(s): Logic, programming, and type systems
2013 - Logical Methods in Computer Science e.V. | Logical Methods in Computer Science
Orna Kupferman, Moshe Y. Vardi,
... checking is PSPACE-complete for ∀CTL and is EXPSPACE-complete for ∀CTL. We then show that the ... the case of ∀CTL assumption, but that the EXPSPACE-hardness result apply already to assumptions in LTL.
Tópico(s): Safety Systems Engineering in Autonomy
1998 - Springer Science+Business Media | Lecture notes in computer science
Nicola Gigante, Andrea Micheli, Angelo Montanari, Enrico Scala,
... be discrete, the problem is known to be EXPSPACE-complete. However, the official PDDL 2.1 semantics ... forbidden, whereas, when it is allowed, it becomes EXPSPACE-complete with ε-separation and even undecidable with ...
Tópico(s): Semantic Web and Ontologies
2022 - Elsevier BV | Artificial Intelligence
... the structural liveness problem for Petri nets is ExpSpace-hard and decidable. In particular, given a net ...
Tópico(s): Distributed systems and fault tolerance
2019 - Springer Science+Business Media | Acta Informatica
... complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity are known. ... each other. We show that this problem is EXPSPACE-complete. As an application of the introduced materials ...
Tópico(s): Logic, programming, and type systems
2011 - Springer Science+Business Media | Lecture notes in computer science
... of BPP-nets (communication-free nets). We show EXPSPACE lower bounds for the simulation problems, in both ...
Tópico(s): Distributed systems and fault tolerance
2009 - Elsevier BV | Information Processing Letters
R. Rodney Howell, Louis E. Rosier, Hsu‐Chun Yen,
... M′≥M; this problem is known to be EXPSPACE hard (Rackoff (1978)[33]). For general Petri nets ...
Tópico(s): Model-Driven Software Engineering Techniques
1987 - Elsevier BV | Information Processing Letters
Béatrice Bérard, Serge Haddad,
... in ITA the reachability problem is in 2-EXPSPACE and in PSPACE when the number of clocks ...
Tópico(s): Real-Time Systems Scheduling
2009 - Springer Science+Business Media | Lecture notes in computer science
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye,
... their complexities (the inclusion problem is for instance EXPSPACE-complete for strongly non-Zeno timed automata).
Tópico(s): semigroups and automata theory
2009 - Springer Science+Business Media | Lecture notes in computer science
Joël Ouaknine, Alexander Rabinovich, James Worrell,
... time intervals, MTL satisfiability and model checking are EXPSPACE-Complete, whereas these problems are decidable but non- ...
Tópico(s): VLSI and Analog Circuit Testing
2009 - Springer Science+Business Media | Lecture notes in computer science
... of constraints. Containment without constraints for CRPQs is EXPSPACE-complete, as opposed to only NP-complete for ...
Tópico(s): Data Management and Algorithms
2002 - Springer Science+Business Media | Lecture notes in computer science
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi,
... view-based query answering for C2RPQc's is EXPSPACE-complete. (2) By exploiting techniques based on alternating ...
Tópico(s): Logic, Reasoning, and Knowledge
2002 - Springer Science+Business Media | Lecture notes in computer science