Abstract
Abstract The importance of real-time systems has enormously increased in the last decade. Application areas that typically need real-time models include railroad systems, intelligent vehicle highway systems, avionics, multimedia and telephony. To assure that such systems are correct, additionally to prove that they provide the required functionality, time constraints must be satisfied. There are already formal specification methods for real-time systems, but most of them are difficult to use by software developers, that are usually not very familiar with mathematical notation but rather specify systems using the objectoriented paradigm. In this paper we propose a formal approach to specify and analyze real-time systems that has an object-oriented flavor. This approach is based on Object-Based Graph Grammars (OBGGs), a formal description technique suitable for the specification of asynchronous distributed systems, and intuitive even for nontheoreticians. We extend OBGGs to enable explicit modeling of time constraints, and define the semantics of the specifications via transition systems. Finally, we translate timed OBGGs to Timed Automata, a formal notation that is wide spread in the area of real-time systems modeling and allows the automatic verification of properties.
Highlights
One of the goals of software engineering is to aid the development of correct and reliable software systems
DEFINITION 11 (SEMANTICS OF Timed Object-Based Graph Grammars (TOBGGs)) Given a timed object-based graph grammar T Object-Based Graph Grammars (OBGGs) = (Spec, X, C, IG, N, n), its semantics is the transition system T S = (IS, States, Lab, T ran) defined by: Initial State: IS = (IG, ClocksIG, mcIG, valIG) where ClocksIG = {cmsg|msg is a timed message of IG}; mcIG(msg) = cmsg, for all timed messages msg of IG; valIG(c) = 0, for all clocks c ∈ ClocksIG
Since our semantic definition for TOBGG was highly inspired by timed automata, the comparison of the transition systems generated by TOBGG and timed automata is straightforward
Summary
One of the goals of software engineering is to aid the development of correct and reliable software systems. In [20] a translation of timed state machines into a real-time specification language TRIO was proposed, but TRIO is not directly model checkable. OUR CONTRIBUTION In this paper, we propose extending the formal description technique Object-Based Graph Grammars (OBGGs) [11, 23] to specify real-time systems. We propose a mapping from a timed extension of OBGG specifications to Timed Automata This way, we can use the available (Timed Automata) verification tools to check properties of timed OBGGs. Our approach adds time stamps to the messages (allowing to program certain events to happen in the future), extends the appealing formal description technique OBGG, and supports verification of properties written in.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
