Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Complexity Results for 1-safe Nets
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Composition for component-based modeling
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
A Framework for Component-based Construction Extended Abstract
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Local and global deadlock-detection in component-based systems are NP-hard
Information Processing Letters
The algebra of connectors: structuring interaction in BIP
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Ensuring properties of interaction systems
Program analysis and compilation, theory and practice
Everything Is PSPACE-Complete in Interaction Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Compositional analysis of deadlock-freedom for tree-like component architectures
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
A Rice-style theorem for parallel automata
Information and Computation
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design
| Hi-index | 0.00 |
Interaction systems are a formal model for component-based systems, where components are combined via connectors to form more complex systems. We compare interaction systems (IS) to the well-studied model of 1-safe Petri nets (1SN) by giving a translation map1: 1SN → IS and a translation map2: IS → 1SN, so that a 1-safe Petri net (an interaction system) and its according interaction system (1-safe Petri net) defined by the respective mapping are isomorphic up to some label relation R. So in some sense both models share the same expressiveness. Also, the encoding map1 is polynomial and can be used to reduce the problems of reachability, deadlock and liveness in 1SN to the problems of reachability, deadlock and liveness in IS, yielding PSPACE-hardness for these questions.