Communicating sequential processes
Communicating sequential processes
Proceedings of the Fourth Annual Symposium on Logic in computer science
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Communication and Concurrency
On the Construction of Live Timed Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Scaling up Uppaal Automatic Verification of Real-Time Systems Using Compositionality and Abstraction
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Compositional Abstraction in Real-Time Model Checking
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Compositional Verification for Component-Based Systems and Application
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Model checking timed automata with priorities using DBM subtraction
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Revising and extending the uppaal communication mechanism
SC'12 Proceedings of the 11th international conference on Software Composition
| Hi-index | 0.00 |
Due to the complexity and time-based aspects of modern systems, compositional verification and abstraction-based verification techniques have been proposed to deal with these issues by considering the verification of system components separately (composition) and working on more abstract structures (refinement). In this paper, we propose a revised definition of the product of timed automata (TA) and give a compositional semantics based on individual timed transition system (TTS) semantics. Moreover, we establish a new compositional refinement property where the refinement of timed systems composition is given by the refinement of each component. For this purpose, starting from the basic timed transition systems, we introduce an original composition operator endowed with good properties (associativity, trace inclusion, etc) and supporting communications via shared variables and synchronization of actions. Thereafter, we instantiate this framework for timed automata where we show how to associate such a TTS with two-levels static priority (committedness) to a TA and establish the compositionality theorem introduced by [5] with the mentioned refinement property.