About the expressive power of CTL combinators
type: Item
instance of: scholarly article
title: About the expressive power of CTL combinators
zbMATH Open document ID: 0875.68632
DOI: 10.1016/0020-0190(95)00053-F
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 985295
zbMATH Keywords: Temporal logic
zbMATH Keywords: CTL
zbMATH Keywords: Program specification
zbMATH Keywords: Specification languages
author: François Laroussinie
MaRDI profile type: Publication
cites work: Q3336675
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: Q4385542
cites work: “Sometimes” and “not never” revisited
cites work: A hierarchy of temporal logics with past
full work available at URL: 0020-0190(95)00053-f
OpenAlex ID: W2027418885
description: scientific article; zbMATH DE number 985295