Browsing by Subject "Model checking"

Sort by: Order: Results:

  • Canonical models and the complexity of modal team logic 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We study modal team logic MTL, the team-semantical extension of classical modal logic closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, ...
  • Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity 
    Virtema, Jonni; Hofmann, Jana; Finkbeiner, Bernd; Kontinen, Juha; Yang, Fan (Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2021)
    We study the expressivity and complexity of model checking of linear temporal logic with team semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining hyperproperties, i.e., properties which ...
  • Model checking and validity in propositional and modal inclusion logics 
    Hella, Lauri; Kuusisto, Antti; Meier, Arne; Virtema, Jonni (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017)
    Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity ...
  • Model checking CTL is almost always inherently sequential 
    Beyersdorff, Olaf; Meier, Arne; Mundhenk, Martin; Schneider, Thomas; Thomas, Michael; Vollmer, Heribert (Braunschweig : International Federation for Computational Logic, 2011)
    The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of ...
  • On the complexity of team logic and its two-variable fragment 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We study the logic FO(∼), the extension of first-order logic with team semantics by unrestricted Boolean negation. It was recently shown to be axiomatizable, but otherwise has not yet received much attention in questions ...
  • Parameterised complexity of model checking and satisfiability in propositional dependence logic 
    Mahmood, Yasir; Meier, Arne (Dordrecht [u.a.] : Springer Science + Business Media B.V, 2021)
    Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations with respect to central decision problems. The model checking ...
  • Team semantics for the specification and verification of hyperproperties 
    Krebs, Andreas; Meier, Arne; Virtema, Jonni; Zimmermann, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an ...
  • The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments 
    Bauland, Michael; Mundhenk, Martin; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert (Amsterdam : Elsevier, 2009)
    In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in ...