Algorithmic probabilistic game semantics. Playing games with automata (Q2248076): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Joël Ouaknine / rank
Normal rank
 
Property / author
 
Property / author: Joël Ouaknine / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LiQuor / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Ymer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MRMC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRISM / 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/s10703-012-0173-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W22667845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4823132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full abstraction for PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic game semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of higher-order state and control effects on local relational reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game-theoretic analysis of call-by-value computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fragment of ML Decidable by Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On full abstraction for PCF: I, II and III / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trivial algorithm whose analysis isn't / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction, Refinement and Proof for Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Thousand-and-One Cryptographers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions with local state: regularity and undecidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP and anonymity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:29, 8 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic probabilistic game semantics. Playing games with automata
scientific article

    Statements

    Algorithmic probabilistic game semantics. Playing games with automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic computation
    0 references
    probabilistic automata
    0 references
    contextual equivalence
    0 references
    full abstraction
    0 references
    game semantics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references