Logic Based Abstractions of Real-Time Systems

  • Authors:

  • Roberto Barbuti;Nicoletta De Francesco;Antonella Santone;Gigiola Vaglini

  • Affiliations:

  • Dipartimento di Informatica, Università di Pisa, I-56125 Pisa, Italy. barbuti@di.unipi.it;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126 Pisa, Italy. nico@iet.unipi.it;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126 Pisa, Italy. santone@iet.unipi.it;Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126 Pisa, Italy. gigliola@iet.unipi.it

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

When verifying concurrent systems described by transition systems, state explosion is one of the most serious problems. If quantitative temporal information (expressed by clock ticks) is considered, state explosion is even more serious. We present a notion of abstraction of transition systems, where the abstraction is driven by the formulae of a quantitative temporal logic, called qu-mu-calculus, defined in the paper. The abstraction is based on a notion of bisimulation equivalence, called 〈ρ, n〉-equivalence, where ρ is a set of actions and n is a natural number. It is proved that two transition systems are 〈ρ, n〉-equivalent iff they give the same truth value to all qu-mu-calculus formulae such that the actions occurring in the modal operators are contained in ρ, and with time constraints whose values are less than or equal to n. We present a non-standard (abstract) semantics for a timed process algebra able to produce reduced transition systems for checking formulae. The abstract semantics, parametric with respect to a set ρ of actions and a natural number n, produces a reduced transition system 〈ρ, n〉-equivalent to the standard one. A transformational method is also defined, by means of which it is possible to syntactically transform a program into a smaller one, still preserving 〈ρ, n〉-equivalence.