Functional Specification of Hardware via Temporal Logic (Q3176382)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Functional Specification of Hardware via Temporal Logic	scientific article

Statements

scholarly article

Functional Specification of Hardware via Temporal Logic (English)

zbMATH Open document ID

10.1007/978-3-319-10575-8_24

Handbook of Model Checking

publication date

20 July 2018

Mathematics Subject Classification ID

zbMATH DE Number

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/978-3-319-10575-8_24

Defining liveness

Recognizing safety and liveness

Hardware and Software, Verification and Testing

Embedding finite automata within regular expressions

Correct Hardware Design and Verification Methods

Some Complexity Results for SystemVerilog Assertions

A topological characterization of weakness

Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations

Computer Aided Verification

Propositional dynamic logic of regular programs

Succinctness of Regular Expressions with Interleaving, Intersection and Counting

Validating the PSL/Sugar semantics using automated reasoning

Process logic: Expressiveness, decidability, completeness

Process logic with regular formulas

State Complexity of Chop Operations on Unary and Finite Languages

Complete Proof System for QPTL

Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness

The complexity of propositional linear temporal logics

The complementation problem for Büchi automata with applications to temporal logic

Star-free regular sets of ω-sequences

From Church and Prior to PSL

Temporal logic can be more expressive

Sitelinks

Mathematics(1 entry)

mardi Publication:3176382

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3176382&oldid=36410151"