Everything Is PSPACE-Complete in Interaction Systems (Q5505604): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A component-based Petri net model for specifying and validating cooperative information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensuring Properties of Interaction Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracts for BIP: Hierarchical Interaction Models for Compositional Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component-Based Construction of Deadlock-Free Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition for component-based modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2764108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank

Latest revision as of 23:52, 28 June 2024

scientific article; zbMATH DE number 5498391
Language Label Description Also known as
English
Everything Is PSPACE-Complete in Interaction Systems
scientific article; zbMATH DE number 5498391

    Statements

    Identifiers