An Automata-based Approach for CTL⋆ With Constraints (Q5179062): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.entcs.2009.05.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974406548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding properties of integral relational automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Model-Checker for Counter Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking LTL with regular valuations for pushdown systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning with Analytic Tableaux and Related Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank

Latest revision as of 21:11, 9 July 2024

scientific article; zbMATH DE number 6416861
Language Label Description Also known as
English
An Automata-based Approach for CTL⋆ With Constraints
scientific article; zbMATH DE number 6416861

    Statements

    Identifiers