<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475797582</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123728.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20001201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1026534200187</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1026534200187</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Logic Based Abstractions of Real-Time Systems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Gigiola Vaglini]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">temporal logic</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">ATP</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">state explosion</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Barbuti</subfield>
   <subfield code="D">Roberto</subfield>
   <subfield code="u">Dipartimento di Informatica, Università di Pisa, I-56125, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">De Francesco</subfield>
   <subfield code="D">Nicoletta</subfield>
   <subfield code="u">Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Santone</subfield>
   <subfield code="D">Antonella</subfield>
   <subfield code="u">Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Vaglini</subfield>
   <subfield code="D">Gigiola</subfield>
   <subfield code="u">Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Formal Methods in System Design</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">17/3(2000-12-01), 201-220</subfield>
   <subfield code="x">0925-9856</subfield>
   <subfield code="q">17:3&lt;201</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">17</subfield>
   <subfield code="o">10703</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1026534200187</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1023/A:1026534200187</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Barbuti</subfield>
   <subfield code="D">Roberto</subfield>
   <subfield code="u">Dipartimento di Informatica, Università di Pisa, I-56125, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">De Francesco</subfield>
   <subfield code="D">Nicoletta</subfield>
   <subfield code="u">Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Santone</subfield>
   <subfield code="D">Antonella</subfield>
   <subfield code="u">Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Vaglini</subfield>
   <subfield code="D">Gigiola</subfield>
   <subfield code="u">Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Formal Methods in System Design</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">17/3(2000-12-01), 201-220</subfield>
   <subfield code="x">0925-9856</subfield>
   <subfield code="q">17:3&lt;201</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">17</subfield>
   <subfield code="o">10703</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
