Branching bisimilarity is an equivalence indeed! (Q1350620): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00034-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160548641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural operational semantics for weak bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\tau\)-bisimulations and full abstraction for refinement of actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three logics for branching bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical foundations of computer science 1993. 18th international symposium, MFCS '93, Gdańsk, Poland, August/September 1993. Proceedings / 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: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733394 / rank
 
Normal rank

Latest revision as of 10:06, 27 May 2024

scientific article
Language Label Description Also known as
English
Branching bisimilarity is an equivalence indeed!
scientific article

    Statements

    Identifiers