CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
type: Item
instance of: scholarly article
title: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
zbMATH Open document ID: 0798.03018
DOI: 10.1016/0304-3975(94)90269-0
author: Mads Dam
published in: Theoretical Computer Science
publication date: 1994-05-15T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 567727
zbMATH Keywords: concurrency
zbMATH Keywords: embeddings
zbMATH Keywords: full branching-time
zbMATH Keywords: modal \(\mu\)-calculus
zbMATH Keywords: tableaux
zbMATH Keywords: extremal fixed points
zbMATH Keywords: Büchi automata
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90269-0
OpenAlex ID: W2112535338
cites work: The temporal logic of branching time
cites work: Local model checking for infinite state spaces
cites work: Automatic Verification of Sequential Circuits Using Temporal Logic
cites work: The formalization and analysis of a communications protocol
cites work: Q3336675
cites work: Q4207567
cites work: Q3329397
cites work: Tableau-based model checking in the propositional mu-calculus
cites work: “Sometimes” and “not never” revisited
cites work: Deciding full branching time logic
cites work: Propositional dynamic logic of regular programs
cites work: An exercise in proving parallel programs correct
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q3711745
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q3907077
cites work: Local model checking in the modal mu-calculus
cites work: Propositional dynamic logic of looping and converse is elementarily decidable
cites work: An automata theoretic decision procedure for the propositional mu- calculus
cites work: Star-free regular sets of ω-sequences
cites work: Q4733423
cites work: Q3341881
cites work: Automated analysis of mutual exclusion algorithms using CCS
cites work: Temporal logic can be more expressive
description: scientific article; zbMATH DE number 567727