There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable nondeterminism and random assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed point theory of unbounded non-determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3945564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded Non-determinism in CSP / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00177-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987915730 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:07, 30 July 2024

scientific article
Language Label Description Also known as
English
There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
scientific article

    Statements

    There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (English)
    0 references
    0 references
    26 May 2016
    0 references
    formal semantics
    0 references
    denotational semantics
    0 references
    fixpoint semantics
    0 references
    fully abstract semantics
    0 references
    non-determinism
    0 references
    infinite computations
    0 references
    concurrency
    0 references

    Identifiers