Nested semantics over finite trees are equationally hard (Q598202): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2158342623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-plus algebra of the natural numbers has no finite equational basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for process generating context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3951525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process algebra for synchronous communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation equivalence is decidable for all context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equational theory of pomsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable equivalences for basic process algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured operational semantics and bisimulation as a congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonaxiomatisability of equivalences over finite state processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375775 / rank
 
Normal rank

Latest revision as of 18:11, 6 June 2024

scientific article
Language Label Description Also known as
English
Nested semantics over finite trees are equationally hard
scientific article

    Statements

    Nested semantics over finite trees are equationally hard (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Concurrency
    0 references
    Process algebra
    0 references
    BCCSP
    0 references
    Nested simulation
    0 references
    Possible futures
    0 references
    Nested trace semantics
    0 references
    Equational logic
    0 references
    Complete axiomatizations
    0 references
    Non-finitely based algebras
    0 references
    Hennessy--Milner logic
    0 references

    Identifiers