Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. Journal of the ACM, 343–354 (1992)
Dams, D.: Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology (1996)
Dams, D., Gerth, R.: The bounded retransmission protocol revisited. ENTCS 9 (2000)
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)
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)
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)
Harel, D., Pnueli, A., Stavi, J.: Propositional dynamic logic of context-free programs. Foundations of Computer Science, 310–321 (1981)
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)
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)
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)
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)
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)
Pnueli, A.: Abstraction for liveness. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 146–164. Springer, Heidelberg (2005)
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)
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)
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)
Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, Heidelberg (2001)
Valero Espada, M.: Modal Abstraction and Replication of Processes with Data. PhD thesis, Free University Amsterdam (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Espada, M.V., van de Pol, J. (2006). Accelerated Modal Abstractions of Labelled Transition Systems. In: Johnson, M., Vene, V. (eds) Algebraic Methodology and Software Technology. AMAST 2006. Lecture Notes in Computer Science, vol 4019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11784180_26
Download citation
DOI: https://doi.org/10.1007/11784180_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35633-2
Online ISBN: 978-3-540-35636-3
eBook Packages: Computer ScienceComputer Science (R0)