Deriving a Simulator for a Hybrid Language Using SOS Rules

Notwithstanding the usefulness of Structured Operational Semantics (SOS) for theoretical aspects, its practical applications are limited in the context of hybrid languages. This kind of semantics spec- ify important behavioral aspects in terms of computations over innite objects but the implementation of tools requires a symbolic treatment of these computations. To derive a simulator from an SOS specication of a hybrid language, we make use of the symbolic SOS approach, obtaining a set of rules without data, which are proven to be a sound and com- plete representation of the original semantics, and at the same time they serve as the basis of the simulator. In this way, we show a practical ap- plication of SOS in the development of simulators for hybrid languages, which enables partial development of equational theories for the explicit version.

[1]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[2]  J. Barondess.  On excellence. , 1988, The Pharos of Alpha Omega Alpha-Honor Medical Society. Alpha Omega Alpha.

[3]  Goran Frehse,et al.  PHAVer: algorithmic verification of hybrid systems past HyTech , 2005, International Journal on Software Tools for Technology Transfer.

[4]  D. A. van Beek,et al.  A semantic-preserving transformation from the compositional interchange format to UPPAAL , 2011 .

[5]  Sjoerd Cranen,et al.  A Rule Format for Associativity , 2008, CONCUR.

[6]  Edward A. Lee,et al.  Operational Semantics of Hybrid Systems , 2005, HSCC.

[7]  van Da Bert Beek,et al.  Linearization of hybrid Chi using program counters , 2007 .

[8]  Luca Aceto,et al.  On Rule Formats for Zero and Unit Elements , 2010, MFPS.

[9]  Jasen Markovski,et al.  Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting , 2010, FORMATS.

[10]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[11]  Nancy A. Lynch,et al.  Hybrid I/O Automata Revisited , 2001, HSCC.

[12]  Arnar Birgisson,et al.  Rule formats for determinism and idempotence , 2009 .

[13]  Jan Friso Groote,et al.  A syntactic commutativity format for SOS , 2005, Inf. Process. Lett..

[14]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[15]  Michael W. Shields.  Hybrid Transition Systems , 1997 .

[16]  Jan Friso Groote,et al.  Notions of bisimulation and congruence formats for SOS with data , 2005, Inf. Comput..

[17]  Jos C. M. Baeten,et al.  Process Algebra: Equational Theories of Communicating Processes , 2009 .

[18]  Arnar Birgisson,et al.  Rule formats for determinism and idempotence , 2009, Sci. Comput. Program..

[19]  Ka Lok Man,et al.  Formal specification and analysis of hybrid systems , 2006 .

[20]  Goran Frehse,et al.  Compositional verification of hybrid systems using simulation relations , 2005 .