Abstraction and Completeness for Real-Time Maude

Authors:
Peter Csaba Ölveczky;José Meseguer
Affiliations:
Department of Informatics, University of Oslo and Department of Computer Science, University of Illinois at Urbana-Champaign;Department of Computer Science, University of Illinois at Urbana-Champaign
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 7
Cited 10

Model checking

Model checking
Specification of real-time and hybrid systems in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Specification and Analysis of the AER/NCA Active Network Protocol Suite in Real-Time Maude

FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Semantics and pragmatics of Real-Time Maude

Higher-Order and Symbolic Computation
Real-Time Maude 2.1

Electronic Notes in Theoretical Computer Science (ENTCS)
Theoroidal maps as algebraic simulations

WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques

Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude

Theoretical Computer Science
The real-time Maude tool

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A formal pattern architecture for safe medical systems

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Validating timed models of deployment components with parametric concurrency

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Semantics, simulation, and formal analysis of modeling languages for embedded systems in real-time Maude

Formal modeling
Object-oriented formal modeling and analysis of interacting hybrid systems in HI-maude

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Formal semantics and analysis of behavioral AADL models in real-time maude

FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude

Science of Computer Programming
Timed CTL model checking in real-time maude

WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents criteria that guarantee completeness of Real-Time Maude search and temporal logic model checking analyses, under the maximal time sampling strategy, for a large class of real-time systems. As a special case, we characterize simple conditions for such completeness for object-oriented real-time systems, and show that these conditions can often be easily proved even for large and complex systems, such as advanced wireless sensor network algorithms and active network multicast protocols. Our results provide completeness and decidability of time-bounded search and model checking for a large and useful class of dense-time non-Zeno real-time systems far beyond the class of automaton-based real-time systems for which well known decision procedures exist. For discrete time, our results justify abstractions that can drastically reduce the state space to make search and model checking analyses feasible.