Statecharts: A visual formalism for complex systems
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Modular refinement of hierarchic reactive machines
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
A Compositional Semantics for Statecharts using Labeled Transition Systems
CONCUR '94 Proceedings of the Concurrency Theory
Verifying Abstractions of Timed Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
A Compositional Rule for Hardware Design Refinement
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Modular Specification of Hybrid Systems in CHARON
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Using Multiple Levels of Abstractions in Embedded Software Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Composing Abstractions of Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Towards component based design of hybrid systems: safety and stability
Time for verification
Modular verification of safe online-reconfiguration for proactive components in mechatronic UML
MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS
Compositional verification and optimization of interactive markov chains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
The assume-guarantee paradigm is a powerful divide-and-conquer mechanism for decomposing a verification task about a system into subtasks about the individual components of the system. The key to assume-guarantee reasoning is to consider each component not in isolation, but in conjunction with assumptions about the context of the component. Assume-guarantee principles are known for purely concurrent contexts, which constrain the input data of a component, as well as for purely sequential contexts, which constrain the entry configurations of a component. We present a model for hierarchical system design which permits the arbitrary nesting of parallel as well as serial composition, and which supports an assume-guarantee principle for mixed parallel-serial contexts. Our model also supports both discrete and continuous processes, and is therefore well-suited for the modeling and analysis of embedded software systems which interact with real-world environments. Using an example of two cooperating robots, we show refinement between a high-level model which specifies continuous timing constraints and an implementation which relies on discrete sampling.