On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The complexity of word problems—this time with interleaving
Information and Computation
Reasoning about infinite computations
Information and Computation
Hybrid Modeling of TCP Congestion Control
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Automata, Tableaux and Temporal Logics (Extended Abstract)
Proceedings of the Conference on Logic of Programs
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Automata based interfaces for control and scheduling
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Stability analysis of switched systems using variational principles: An introduction
Automatica (Journal of IFAC)
Channel models for ultrawideband personal area networks
IEEE Wireless Communications
Automatica (Journal of IFAC)
Hi-index | 0.00 |
A switched system is composed of components. The components do not interact with one another. Rather, they all interact with the same environment, which switches one of them on at each moment in time. In standard concurrency, a component restricts the environment of the other components, thus the concurrent system has fewer behaviors than its components. On the other hand, in a switched system, a component suggests an alternative to the other components, thus the switched system has richer behaviors than its components. We study finite-state switched systems, where each of the underlying components is a finite-state transducer. While the main challenge, namely compositionality, is similar in standard concurrent systems and in switched systems, the problems and solutions are different. In the verification front, we suggest and study an assume-guarantee paradigm for switched systems, and study formalisms in which satisfaction of a specification in all components imply its satisfaction in the switched system. In the synthesis front, we show that while compositional synthesis and design are undecidable, the problem of synthesizing a switching rule with which a given switched system satisfies an LTL specification is decidable.