On deciding some equivalences for concurrent processes (Q4362275): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3774929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Readies and Failures in the Algebra of Communicating Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes canoniques de graphes algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel complexity of coarsest set partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinacy \(\to\) (observation equivalence \(=\) trace equivalence) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: 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: Q4198075 / 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: On deciding trace equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032309 / 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: A note on the complexity of deciding bisimilarity of normed unary processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / 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: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification-oriented semantics for communicating processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refusal testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape-bounded complexity classes and multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank

Latest revision as of 19:46, 27 May 2024

scientific article; zbMATH DE number 1081170
Language Label Description Also known as
English
On deciding some equivalences for concurrent processes
scientific article; zbMATH DE number 1081170

    Statements

    On deciding some equivalences for concurrent processes (English)
    0 references
    0 references
    0 references
    28 October 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references