Deciding bisimulation-like equivalences with finite-state processes (Q5941202): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Process Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of pushdown automata: Application to model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regular structure of prefix rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing expressibility of normed BPA and normed BPP processes / 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: Decidability of model checking for infinite-state concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of a temporal logic problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of bisimilarity for Petri nets and some related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective decomposability of sequential behaviours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking PA-processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking with the temporal logic EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process rewrite systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic formulae for processes with divergence / 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: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ehrenfeucht-Fraïssé game in theoretical computer science / rank
 
Normal rank

Revision as of 19:22, 3 June 2024

scientific article; zbMATH DE number 1635367
Language Label Description Also known as
English
Deciding bisimulation-like equivalences with finite-state processes
scientific article; zbMATH DE number 1635367

    Statements

    Deciding bisimulation-like equivalences with finite-state processes (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2001
    0 references
    0 references
    concurrency
    0 references
    bisimulation
    0 references
    characteristic formulae
    0 references
    infinite-state systems
    0 references