Branching versus linear logics yet again (Q911747): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unreal future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded commands, nondeterminacy and formal derivation of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative semantics for temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The INFOLOG linear tense propositional logic of events and transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and verification of database dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tense systems with discrete moments of time. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatising the logic of computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process logic: Expressiveness, decidability, completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with time and chance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of dynamic integrity constraints into transaction specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets, event structures and domains. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Liveness Properties of Concurrent Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling concurrency with partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal aspects of logical procedure definition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indeterminist time and truth‐value gaps<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete deductive-system for since-until branching-time logic / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01888216 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018583412 / rank
 
Normal rank

Latest revision as of 09:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Branching versus linear logics yet again
scientific article

    Statements

    Branching versus linear logics yet again (English)
    0 references
    0 references
    0 references
    1990
    0 references
    linear and branching models
    0 references
    state and path formulas
    0 references
    frame change operators
    0 references
    axiomatisations
    0 references
    completeness
    0 references
    information systems specification and verification
    0 references
    safety and liveness
    0 references
    temporal logics
    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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references