Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622): 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.entcs.2008.04.065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993247717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking for infinite-state concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790409 / 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: Bisimulation equivalence is decidable for all context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary bisimulation decision procedure for arbitrary context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for normed pushdown processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Actions speak louder than words: proving bisimilarity for context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the decidability of bisimulation for normed BPA- processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau / rank
 
Normal rank

Latest revision as of 12:58, 8 July 2024

scientific article; zbMATH DE number 6294822
Language Label Description Also known as
English
Decidability of Weak Bisimilarity for a Subset of BPA
scientific article; zbMATH DE number 6294822

    Statements

    Decidability of Weak Bisimilarity for a Subset of BPA (English)
    0 references
    13 May 2014
    0 references
    0 references
    BPA
    0 references
    normed
    0 references
    tableau
    0 references
    decidabilty
    0 references
    0 references
    0 references