Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (Q1944909): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.ipl.2011.01.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984568289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equational theory of prebisimilarity over basic CCS with divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the axiomatisability of priority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes, Terms and Cycles: Steps on the Road to Infinity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite equational base for CCS with left merge and communication merge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting non-finite axiomatizability results to extensions of process algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation can't be traced / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite alphabets and infinite bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Unification of Process Semantics: Equational Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural approach to operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossible futures and determinism / rank
 
Normal rank

Latest revision as of 08:26, 6 July 2024

scientific article
Language Label Description Also known as
English
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
scientific article

    Statements

    Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2013
    0 references
    0 references
    concurrency
    0 references
    process algebra
    0 references
    complete simulation
    0 references
    ready simulation
    0 references
    equational logic
    0 references
    non-finitely based algebras
    0 references
    0 references