Functional Specification of Hardware via Temporal Logic (Q3176382): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FoCs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-10575-8_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2804949216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing safety and liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardware and Software, Verification and Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding finite automata within regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correct Hardware Design and Verification Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Complexity Results for SystemVerilog Assertions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological characterization of weakness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness of Regular Expressions with Interleaving, Intersection and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validating the PSL/Sugar semantics using automated reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process logic: Expressiveness, decidability, completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process logic with regular formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Chop Operations on Unary and Finite Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Proof System for QPTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementation problem for Büchi automata with applications to temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-free regular sets of ω-sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Church and Prior to PSL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank

Latest revision as of 03:56, 16 July 2024

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

    Statements

    Functional Specification of Hardware via Temporal Logic (English)
    0 references
    0 references
    0 references
    20 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers