The Decidability of the Reachability Problem for CCS! (Q3090842): 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.1007/978-3-642-23217-6_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1821089671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial and Behavioral Types in the Pi-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of Restriction and Priorities in CCS with Replication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of recursion, replication and iteration in process calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressiveness of interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decidability of the Reachability Problem for CCS! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Behavioral Equivalences in Process Calculi with Name Scoping / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / 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: Q4248252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite representations of CCS and TCSP programs by automata and Petri nets / rank
 
Normal rank

Latest revision as of 11:02, 4 July 2024

scientific article
Language Label Description Also known as
English
The Decidability of the Reachability Problem for CCS!
scientific article

    Statements

    The Decidability of the Reachability Problem for CCS! (English)
    0 references
    0 references
    2 September 2011
    0 references

    Identifiers