MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems

This paper presents MODEST (modeling and description language for stochastic timed systems), a formalism that is intended to support 1) the modular description of reactive systems' behavior while covering both 2) functional and 3) nonfunctional system aspects such as timing and quality-of-service constraints in a single specification. The language contains, features such as simple and structured data types, structuring mechanisms like parallel composition and abstraction, means to control the granularity of assignments, exception handling, and nondeterministic and random branching and timing. MODEST can be viewed as an overarching notation for a wide spectrum of models, ranging from labeled transition systems to timed automata (and probabilistic variants thereof), as well as prominent stochastic processes such as (generalized semi-) Markov chains and decision processes. The paper describes the design rationales and details of the syntax and semantics

[1]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[2]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[3]  Gerard J. Holzmann.  Formal methods and software reliability , 2004, Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04..

[4]  Holger Hermanns,et al.  Synthesis and stochastic assessment of schedules for lacquer production , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..

[5]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[6]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[7]  Mihaela Sighireanu,et al.  A Graphical Parallel Composition Operator for Process Algebras , 1999, FORTE.

[8]  Joost-Pieter Katoen,et al.  Are you still there? - A lightweight algorithm to monitor node presence in self-configuring networks , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[9]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

[10]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[11]  R. Segala,et al.  Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.

[12]  Gérard Berry,et al.  Preemption in Concurrent Systems , 1993, FSTTCS.

[13]  Holger Hermanns,et al.  Generalisation of the Well-Specified Check , 2003 .

[14]  Joseph Sifakis,et al.  An Algebraic Framework for Urgency , 2000, Inf. Comput..

[15]  Christel Baier,et al.  PROBMELA: a modeling language for communicating probabilistic processes , 2004, Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04..

[16]  Peter Claussen.  Theories of programming languages , 2000, SOEN.

[17]  Hans Rischel,et al.  Introduction to Programming Using Sml , 1999 .

[18]  Pedro R. D'Argenio,et al.  Algebras and Automata for Timed and Stochastic Systems , 1999 .

[19]  Gianfranco Ciardo,et al.  Well-defined stochastic Petri nets , 1996, Proceedings of MASCOTS '96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[20]  William F. Gilreath,et al.  Concurrency State Models and Java Programs , 2000, Parallel Distributed Comput. Pract..

[21]  Luca Aceto,et al.  A static view of localities , 1994, Formal Aspects of Computing.

[22]  J. Ben Atkinson,et al.  Modeling and Analysis of Stochastic Systems , 1996 .

[23]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[24]  Erik P. de Vink,et al.  Probabilistic Automata: System Types, Parallel Composition and Comparison , 2004, Validation of Stochastic Systems.

[25]  David C. Luckham,et al.  Ada exception handling: an axiomatic approach , 1980, TOPL.

[26]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[27]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[28]  Wang Yi,et al.  Automatic verification of real-time communicating systems by constraint-solving , 1994, FORTE.

[29]  P. Glynn.  A GSMP formalism for discrete event systems , 1989, Proc. IEEE.

[30]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[31]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[32]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[33]  Joost-Pieter Katoen,et al.  The Modest Modeling Tool and Its Implementation , 2003, Computer Performance Evaluation / TOOLS.

[34]  Pedro R. D'Argenio.  A Calculus for Timed Automata (Extended Abstract)* , 2005 .

[35]  Pedro R. D'Argenio,et al.  A Calculus for Timed Automata , 1996, FTRTFT.

[36]  Stephen A. Edwards,et al.  Design of embedded systems: formal models, validation, and synthesis , 1997, Proc. IEEE.

[37]  Holger Hermanns,et al.  From StoCharts to MoDeST: a comparative reliability analysis of train radio communications , 2005, WOSP '05.

[38]  Mihaela Sighireanu,et al.  On the Introduction of Exceptions in E-LOTOS , 1996, FORTE.

[39]  Mordechai Ben-Ari,et al.  Principles of concurrent and distributed programming , 2005, PHI Series in computer science.

[40]  Jeff Magee,et al.  Concurrency - state models and Java programs , 2006 .

[41]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

[42]  Biniam Gebremichael,et al.  The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation , 2005, CONCUR.

[43]  Joost-Pieter Katoen,et al.  Process algebra for performance evaluation , 2002, Theor. Comput. Sci..

[44]  Mario Bravetti,et al.  Tutte le Algebre Insieme: Concepts, Discussions and Relations of Stochastic Process Algebras with General Distributions , 2004, Validation of Stochastic Systems.

[45]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[46]  Tammy Noergaard,et al.  Embedded Software , 2003, Lecture Notes in Computer Science.

[47]  William H. Sanders,et al.  The Möbius Framework and Its Implementation , 2002, IEEE Trans. Software Eng..

[48]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[49]  William H. Sanders,et al.  An efficient well-specified check , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[51]  Joost-Pieter Katoen,et al.  On Generative Parallel Composition , 1998, PROBMIV.

[52]  Joost-Pieter Katoen,et al.  Specification and analysis of soft real-time systems: quantity and quality , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[53]  André Schiper,et al.  On the accuracy of MANET simulators , 2002, POMC '02.

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

[55]  Mario Bravetti,et al.  The theory of interactive generalized semi-Markov processes , 2002, Theor. Comput. Sci..

[56]  Gerard J. Holzmann,et al.  The SPIN Model Checker , 2003 .

[57]  Joost-Pieter Katoen,et al.  MoDeST - A Modelling and Description Language for Stochastic Timed Systems , 2001, PAPM-PROBMIV.

[58]  Eugene A. Feinberg,et al.  Handbook of Markov Decision Processes , 2002 .

[59]  V Victor Bos,et al.  Formal specification and analysis of industrial systems , 2002 .

[60]  Joost-Pieter Katoen,et al.  An algebraic approach to the specification of stochastic systems , 1998, PROCOMET.

[61]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[62]  B. Gebremichael-Tesfagiorgis,et al.  Axiomatizing Timed Automata with Deadlines , 2006 .

[63]  Vassilis Mertsiotakis,et al.  Approximate analysis methods for stochastic process algebras , 1998 .

[64]  Marta Z. Kwiatkowska,et al.  Stochastic Transition Systems for Continuous State Spaces and Non-determinism , 2005, FoSSaCS.

[65]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[66]  Nancy A. Lynch,et al.  Action transducers and timed automata , 1992, Formal Aspects of Computing.