Everything Is PSPACE-Complete in Interaction Systems

DOI10.1007/978-3-540-85762-4_15zbMath1161.68625OpenAlexW1530284785MaRDI QIDQ5505604

Christoph Minnameier, Mila E. Majster-Cederbaum

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_15

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Rigorous development of component-based systems using component metadata and patterns ⋮ Deadlock-freedom in component systems with architectural constraints ⋮ Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composition for component-based modeling
• Relationships between nondeterministic and deterministic tape complexities
• Ensuring Properties of Interaction Systems
• Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
• A component-based Petri net model for specifying and validating cooperative information systems
• Component-Based Construction of Deadlock-Free Systems
• Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
• A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems

This page was built for publication: Everything Is PSPACE-Complete in Interaction Systems