# Model Checking Classes of Metric LTL Properties of Object-Oriented Real-Time Maude Specifications

@inproceedings{Lepri2010ModelCC, title={Model Checking Classes of Metric LTL Properties of Object-Oriented Real-Time Maude Specifications}, author={Daniela Lepri and Peter Csaba {\"O}lveczky and Erika {\'A}brah{\'a}m}, booktitle={RTRTS}, year={2010} }

This paper presents a transformational approach for model checking two important classes of metric temporal logic (MTL) properties, namely, bounded response and minimum separation, for nonhierarchical object-oriented Real-Time Maude specifications. We prove the correctness of our model checking algorithms, which terminate under reasonable non-Zeno-ness assumptions when the reachable state space is finite. These new model checking features have been integrated into Real-Time Maude, and are used…

## 9 Citations

### Timed CTL Model Checking in Real-Time Maude

- Computer ScienceWRLA
- 2012

This paper gives a timed CTL model checking procedure for Real- Time Maude that is sound and complete for closedbound formulas under a continuous semantics for a fairly large class of systems.

### Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking

- Computer ScienceCS&P
- 2013

The existential model checking problem for MTL is translated to the existential model Checking problem for a variant of linear temporal logic (called HLTL), and a SAT-based bounded model checking method is provided for HLTL.

### Sound and complete timed CTL model checking of timed Kripke structures and real-time rewrite theories

- Computer ScienceSci. Comput. Program.
- 2015

### Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude

- Computer Science, PhysicsSci. Comput. Program.
- 2012

### A Translation of the Existential Model Checking Problem from MITL to HLTL

- Computer ScienceFundam. Informaticae
- 2013

In the paper, a translation of the existential model checking problem for timed automata and properties expressible in MITL to theexistential model checkingProblem for HLTL is proposed to adopt LTL bounded model checking method for verification of the MITL properties.

### Specification and Verification of Distributed Embedded Systems: A Traffic Intersection Product Family

- Computer ScienceRTRTS
- 2010

An extensive industry-based case study involving a DES product family for a pedestrian and car 4-way traffic intersection in which autonomous devices communicate by asynchronous message passing without a centralized controller is reported on.

### Modeling and Analyzing Adaptive User-Centric Systems in Real-Time Maude

- Computer ScienceRTRTS
- 2010

This paper proposes a component-based approach for modeling pervasive user-centric systems in a generic way and shows how to instantiate the generic rules for a simple out-of-home digital advertising application and how to analyze and prove crucial properties of the system architecture through model checking and simulation.

### Rewriting logic bibliography by topic: 1990-2011

- Computer ScienceJ. Log. Algebraic Methods Program.
- 2012

## References

SHOWING 1-10 OF 32 REFERENCES

### On the decidability of metric temporal logic

- Computer Science20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
- 2005

It is shown that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity, and that model checking the safety fragment of MTL-which includes invariance and time-bounded response properties-is also decidable.

### Semantics and pragmatics of Real-Time Maude

- Computer ScienceHigh. Order Symb. Comput.
- 2007

This paper describes both the semantics of Real-Time Maude specifications, and of the formal analyses supported by the tool, and explains the tool's pragmatics, both in the use of its features, and in its application to concrete examples.

### Verifying Ptolemy II Discrete-Event Models Using Real-Time Maude

- Physics, Computer ScienceICFEM
- 2009

This paper shows how Ptolemy II discrete-event (DE) models can be formally analyzed using Real-Time Maude. We formalize in Real-Time Maude the semantics of a subset of hierarchical Ptolemy II DE…

### KRONOS: a verification tool for real-time systems

- Computer ScienceInternational Journal on Software Tools for Technology Transfer
- 1997

The main purpose of this paper is to explain how to use Kronos, a tool for formally checking whether a real-time system meets its requirements. Kronos is founded on the theory of timed automata and…

### Logics and Models of Real Time: A Survey

- Computer ScienceREX Workshop
- 1991

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

- Computer ScienceFormal Methods Syst. Des.
- 2001

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.

### Formal Semantics and Analysis of Behavioral AADL Models in Real-Time Maude

- Computer ScienceFMOODS/FORTE
- 2010

This work presents a formal object-based real-time concurrent semantics for a behavioral subset of AADL in rewriting logic, which includes the essential aspects of its behavior annex.

### Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude

- Computer ScienceFASE
- 2006

This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications, and discovered subtle behaviors in the modifications that lead to missed deadlines.

### REDLIB for the Formal Verification of Embedded Systems

- Computer ScienceSecond International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006)
- 2006

This article discusses the features of REDLIB and gives small examples to show how to use REDLIB, which supports full TCTL model- checking of dense-time automata with multiple fairness assumptions.