Reachability problems in BioAmbients (Q418830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92C42 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6039198 / rank
 
Normal rank
Property / zbMATH Keywords
 
bio-inspired process calculi
Property / zbMATH Keywords: bio-inspired process calculi / rank
 
Normal rank
Property / zbMATH Keywords
 
reachability analysis
Property / zbMATH Keywords: reachability analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
Petri nets
Property / zbMATH Keywords: Petri nets / rank
 
Normal rank
Property / zbMATH Keywords
 
Turing completeness
Property / zbMATH Keywords: Turing completeness / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037088969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Reachability Problem in P Systems with Mobile Membranes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Completeness Using Three Mobile Membranes / rank
 
Normal rank
Property / cites work
 
Property / cites work: When ambients cannot be opened / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding reachability problems in Turing-complete fragments of Mobile Ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal molecular biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Reachability in Mobile Ambients with Name Restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reachability and Spatial Reachability in Fragments of BioAmbients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the verification of membrane systems with dynamic structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational strength of pure ambient calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of mobile processes. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: BioAmbients: an abstraction for biological compartments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis in BioAmbients / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Reachability problems in BioAmbients
scientific article

    Statements

    Reachability problems in BioAmbients (English)
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    bio-inspired process calculi
    0 references
    reachability analysis
    0 references
    Petri nets
    0 references
    Turing completeness
    0 references
    0 references