• Home
  • Search
  • The Complexity of Model Checking Multi-Stack Systems
  • Open Access IconOpen Access
  • Cite Icon7
  • https://doi.org/10.1007/s00224-016-9700-6Copy DOI Icon

The Complexity of Model Checking Multi-Stack Systems

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We study the linear-time model checking problem for boolean concurrent programs with recursive procedure calls. While sequential recursive programs are usually modeled as pushdown automata, concurrent recursive programs involve several processes and can be naturally abstracted as pushdown automata with multiple stacks. Their behavior can be understood as words with multiple nesting relations, each relation connecting a procedure call with its corresponding return. To reason about multiply nested words, we consider the class of all temporal logics as defined in the book by Gabbay, Hodkinson, and Reynolds (18). The unifying feature of these temporal logics is that their modalities are defined in monadic second-order (MSO) logic. In particular, this captures numerous temporal logics over concurrent and/or recursive programs that have been defined so far. Since the general model checking problem is undecidable, we restrict attention to phase bounded executions as proposed by La Torre, Madhusudan, and Parlato (LICS 24). While the MSO model checking problem in this case is non-elementary, our main result states that the model checking (and satisfiability) problem for all MSO-definable temporal logics is decidable in elementary time. More precisely, it is solvable in time exponential in the formula and (n+2)-fold exponential in the number of phases where n is the maximal level of the MSO modalities in the monadic quantifier alternation hierarchy (which is a vast improvement over the conference version of this paper from LICS 2013 where the space was also (n+2)-fold exponential in the size of the temporal formula). We complement this result and provide, for each level n, a temporal logic whose model checking problem is n-EXPSPACE-hard.

Similar Papers
  • Conference Article
  • Citations10

The Complexity of Model Checking Multi-stack Systems

  • Jun 01, 2013
  • Benedikt Bollig +2
  • Research Article
  • Citations11

Model checking interval temporal logics with regular expressions

  • Dec 11, 2019
  • Information and Computation
  • Laura Bozzelli +3
  • Research Article
  • Citations20

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions

  • Sep 06, 2017
  • Electronic Proceedings in Theoretical Computer Science
  • Laura Bozzelli +3
  • Dissertation
  • Citations2

Controlling the Generation of Multiple Counterexamples in LTL Model Checking

  • Dec 19, 2014
  • The University of Queensland
  • Sentot Kromodimoelijo
  • Book Chapter
  • Citations22

Languages of Nested Trees

  • Jan 01, 2006
  • Rajeev Alur +2
  • Research Article
  • Citations35

Problems concerning fairness and temporal logic for conflict-free petri nets

  • May 01, 1989
  • Theoretical Computer Science
  • Rodney R Howell +1
  • Book Chapter
  • Citations26

On questions of fairness and temporal logic for conflict-free Petri nets

  • Jan 01, 1988
  • Rodney R Howell +1
  • Research Article
  • Citations9

Model checking dynamic pushdown networks

  • Jan 08, 2015
  • Formal Aspects of Computing
  • Fu Song +1
  • Research Article
  • Citations6

On temporal logics with data variable quantifications: Decidability and complexity

  • Aug 16, 2016
  • Information and Computation
  • Fu Song +1
  • Research Article

Describing properties of concurrent systems (Logic for Traces): (invited talk)

  • Sep 01, 2002
  • Electronic Notes in Theoretical Computer Science
  • Walukiewicz Igor
  • Book Chapter
  • Citations162

Generalized Model Checking: Reasoning about Partial State Spaces

  • Jan 01, 2000
  • Glenn Bruns +1
  • Abstract
  • Citations11

Alternating-time temporal logic

  • Jun 01, 1999
  • Computer Standards & Interfaces
  • Rajeev Alur +2
  • Book Chapter
  • Citations32

Time-Bounded Verification

  • Jan 01, 2009
  • Joël Ouaknine +2
  • Research Article
  • Citations15

Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy

  • Sep 06, 2018
  • Information and Computation
  • Laura Bozzelli +4
  • Supplementary Content
  • Citations3

Logics in Computer Science

  • Jan 01, 2013
  • Università degli Studi di Napoli Federico II
  • Fabio Mogavero
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.