Semantics and pragmatics of Real-Time Maude

  title={Semantics and pragmatics of Real-Time Maude},
  author={Peter Csaba {\"O}lveczky and Jos{\'e} Meseguer},
  journal={Higher-Order and Symbolic Computation},
At present, designers of real-time systems face a dilemma between expressiveness and automatic verification: if they can specify some aspects of their system in some automaton-based formalism, then automatic verification is possible; but more complex system components may be hard or impossible to express in such decidable formalisms. These more complex components may still be simulated; but there is then little support for their formal analysis. The main goal of Real-Time Maude is to provide a… 

Abstraction and Completeness for Real-Time Maude

Recent Advances in Real-Time Maude

Rewriting-Logic-Based Formal Modeling and Analysis of Interacting Hybrid Systems

This work targets complex hybrid systems where the physical entities interact and may influence each other’s continuous behavior, and defines a general object-oriented modeling methodology for modeling such interacting hybrid systems in Real-Time Maude.

Verification of Complex Real-Time Systems using Rewriting Logic

  • M. Bourahla
  • Computer Science
    J. Comput. Inf. Technol.
  • 2009
This paper presents a method for model checking dense complex real-time systems using Maude LTL model checking at the meta level of the Rewriting Logic system Maude which results in an untimed automaton modulo the TLTL property.

Real-Time Maude and Its Applications

The Real-Time Maude system is extended to support the executable formal modeling and analysis of real-time systems, and offers a spectrum of formal analysis methods, including: rewriting for simulation purposes, search for reachability analysis, and both untimed and metric temporal logic model checking.

The Real-Time Maude Tool

Real-Time Maude is a rewriting-logic-based tool supporting the formal specification and analysis of real-time systems. Our tool emphasizes expressiveness and ease of specification over algorithmic

Formal Specification and Analysis of Timing Properties in Software Systems

A new specification language and analysis framework for expressing and analyzing timing behaviors of complex software systems that is expressive, supports trace analysis and simulation of timing behaviors, and allows for verification of properties of specification.

Probabilistic Real-Time Rewrite Theories and Their Expressive Power

It is shown that PRTRTs can be seen as a unifying model in which a range of other models for probabilistic real-time systems--including probabilism timed automata, deterministic and stochastic Petri nets, as well as two Probabilistic timed transition system models with underspecified probability distributions--can naturally be represented.

Formal verification of Fischer’s real-time mutual exclusion protocol by the OTS/CafeOBJ method

This paper model Fischer’s protocol as an observational transition system, describe it in CafeOBJ algebraic specification language, and verify that different processes do not enter the critical section at the same time by the proof score method based on equational reasoning implemented in cafeOBJ interpreter.



Real-Time Maude 2.3 manual

The version 2.3 of the language and tool Real-Time Maude is described, which offers a wide range of analysis techniques, including timed rewriting for simulation purposes, untimed and time-bounded search for states that are reachable from the initial state and match a given search pattern.

Logics and Models of Real Time: A Survey

We survey logic-based and automata-based languages and techniques for the specification and verification of real-time systems. In particular, we discuss three syntactic extensions of temporal logic:

Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude

The experience shows that Real-Time Maude is well-suited to meet the AER/NCA modeling challenges, and that its methods have proved effective in uncovering subtle and important errors in the informal use case specification.

Specification of real-time and hybrid systems in rewriting logic

A Theory of Timed Automata

Model Checking

Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.

The IF Toolset

The toolset is built upon a rich formalism, the IF notation, allowing structured automata-based system representations, and is expressive enough to support real-time primitives and extensions of high-level modelling languages such as SDL and UML by means of structure preserving mappings.

Tools and Applications II: The IF Toolset

An overview on the IF toolset which is an environment for modelling and validation of heterogeneous real-time systems and a methodology for the use of the toolset is presented at hand of a case study concerning the Ariane-5 Flight Program for which both an SDL and a UML model have been validated.

Models for reactivity

A hierarchy of models that capture realistic aspects of reactive, real-time, and hybrid systems is introduced and a requirement specification language based on extensions of temporal logic, system description languages based on State charts and a textual programming language is presented.