Accelerated Modal Abstractions of Labelled Transition Systems

  • Miguel Valero Espada
  • Jaco van de Pol
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4019)


Modal Labelled Transition Systems (Modal-LTSs) can be used to specify system behaviour. They distinguish between required behaviour and allowed behaviour. This makes Modal-LTSs a suitable formalism to specify abstractions of a system by over- and under-approximations. This paper studies an extension to Modal-LTSs by allowing accelerated-transitions, i.e. transitions labelled with regular expressions. This permits to represent that a process can reach a state by executing some sequence of actions, abstracting away the intermediate states. We show how accelerated transitions improve the expressiveness of abstractions. Consequently, more liveness properties can be checked.


Model Check Regular Expression Label Transition System Liveness Property Concrete System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bosnacki, D., Ioustinova, N., Sidorova, N.: Using fairness to make abstractions work. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 198–215. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. Journal of the ACM, 343–354 (1992)Google Scholar
  3. 3.
    Dams, D.: Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology (1996)Google Scholar
  4. 4.
    Dams, D., Gerth, R.: The bounded retransmission protocol revisited. ENTCS 9 (2000)Google Scholar
  5. 5.
    Fang, Y., Piterman, N., Pnueli, A., Zuck, L.: Liveness with invisible ranking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 223–238. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-based model checking using modal transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 426–440. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Groote, J.F., van de Pol, J.C.: A bounded retransmission protocol for large data packets. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol. 1101, pp. 536–550. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  8. 8.
    Harel, D., Pnueli, A., Stavi, J.: Propositional dynamic logic of context-free programs. Foundations of Computer Science, 310–321 (1981)Google Scholar
  9. 9.
    Hennessey, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 295–309. Springer, Heidelberg (1980)Google Scholar
  10. 10.
    Kesten, Y., Pnueli, A.: Verifying liveness by augmented abstraction. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 141–145. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  11. 11.
    Larsen, K.G., Thomsen, B.: A modal process logic. In: Proc. of Logic in Computer Science (LICS), pp. 203–210. IEEE Computer Society Press, Los Alamitos (1988)Google Scholar
  12. 12.
    Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: Proc. of Logic in Computer Science (LICS), pp. 108–117. IEEE, Los Alamitos (1990)Google Scholar
  13. 13.
    Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 11–44 (1995)Google Scholar
  14. 14.
    Pnueli, A.: Abstraction for liveness. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 146–164. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    van de Pol, J.C., Valero Espada, M.: Modal abstraction in μCRL. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 409–425. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Schmidt, D.: Structure-preserving binary relations for program abstraction. In: Mogensen, T.Æ., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 245–268. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  17. 17.
    Shoham, S., Grumberg, O.: Monotonic abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 546–560. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  18. 18.
    Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, Heidelberg (2001)Google Scholar
  19. 19.
    Valero Espada, M.: Modal Abstraction and Replication of Processes with Data. PhD thesis, Free University Amsterdam (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Miguel Valero Espada
    • 1
  • Jaco van de Pol
    • 2
  1. 1.Universidad Complutense de MadridSpain
  2. 2.Centrum voor Wiskunde en InformaticaAmsterdamThe Netherlands

Personalised recommendations