scientific article; zbMATH DE number 7649915

DOI10.4230/LIPIcs.CONCUR.2019.7MaRDI QIDQ5875368

Krishnendu Chatterjee, Wolfgang Dvořák, Alexander Svozil, Monika R. Henzinger

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1909.05539

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

model checkinggraph gamesstreett games

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Fine-grained complexity lower bounds for problems in computer aided verification ⋮ Unnamed Item ⋮ Algorithms and conditional lower bounds for planning problems

Uses Software

• PRISM
• SPIN
• NuSMV
• LiQuor
• Storm
• Rabinizer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of quantifiers is better than number of tape cells
• NuSMV: A new symbolic model checker
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
• Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
• On the menbership problem for functional and multivalued dependencies in relational databases
• The complexity of probabilistic verification
• Improved Algorithms for One-Pair and k-Pair Streett Objectives
• Model and Objective Separation with Conditional Lower Bounds
• Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
• Decremental strongly-connected components and single-source reachability in near-linear time
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: