The Maude LTL Model Checker and Its Implementation | Zendy

Steven Eker | Zendy; José Meseguer | Zendy; Ambarish Sridharanarayanan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Maude LTL Model Checker and Its Implementation

Author(s) -

Steven Eker,

José Meseguer,

Ambarish Sridharanarayanan

Publication year - 2003

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/3-540-44829-2_16

Subject(s) - model checking , computer science , programming language , temporal logic , linear temporal logic , property (philosophy) , state (computer science) , formal specification , philosophy , epistemology

A model checker typically supports two different levels of specification: (1) a system specification level, in which the concurrent system to be analyzed is formalized; and (2) a property specification level, in which the properties to be model checked—for example, temporal logic formulae—are specified. The Maude LTL model checker has been designed with the goal of combining a very expressive and general system specification language (Maude [1]) with an advanced on-the-fly explicit-state LTL model checking engine.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research