A partition refinement algorithm for the \(\pi\)-calculus (Q1854406): 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.1006/inco.2000.2895 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972340458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimulation equivalences for a class of non-finite-state programs / 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: A calculus of mobile processes. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic verification of a mobile network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of bisimulation for the \(\pi\)-calculus / rank
 
Normal rank

Latest revision as of 10:10, 5 June 2024

scientific article
Language Label Description Also known as
English
A partition refinement algorithm for the \(\pi\)-calculus
scientific article

    Statements

    Identifiers