Abstract
We consider the problem of verifying properties in processes with durational actions. The properties are expressed in terms of a discrete-time extension of ACTL. The algorithm for model checking formulae in this logic over finite state timed transition systems is provided. We consider processes that have infinite models due to the increase of the value of the clock and show how to reduce the verification problem over the infinite models to the one over their compact finite representations.
This work has been partially founded by EEC within the HCM Project EXPRESS, and by Italian CNR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto and D. Murphy. Timing and causality in process algebra. Acta Informatica 33 (4), pp.317–350, 1996.
R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. IEEE LICS, pp.414–425, 1990.
R. Alur, T. Feder and T.A. Henzinger. The benefits of relaxing punctuality. 10th ACM PODC, 1991.
R. Alur and T. Henzinger. A Really Temporal Logic. TCS 126, 1994.
S. Brooks and W. Rounds. Behavioural equivalence relations induced by programming logics. LNCS 154, pp.97–108, Springer-Verlag, 1983.
M.C. Browne, E.M. Clarke, and O. Grumberg. Characterizing finite Kripke structure in propositional temporal logic. TCS 59, pp.115–131, 1988.
X.J. Chen, F. Corradini, and R. Gorrieri. A Study on the Specification and Verification of Performance Properties. AMAST'96, LNCS 1101, pp.306–320, 1996.
F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder: Ordering processes with respect to speed. In MFCS'95, LNCS 969, pp.444–453, 1995. See also: Performance preorder and competitive equivalence. Acta Informatica 33 (11), 1997.
F. Corradini, and M. Pistore. Specification and Verification of Timed Lazy Systems. MFCS'96, LNCS 1113, pp.279–290, 1996. See also: Specification and Verification of Timed Systems. Technical Report 107/96, Department of Pure and Applied Mathematics, University of L'Aquila, 1996.
R. De Nicola, A. Fantechi, S. Gnesi, and G. Ristori. An action-based framework for verifying logical and behavioural properties of concurrent systems. Computer Networks and ISDN Systems, 25, pp.761–778, 1993.
R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of ACM 42 (2), pp.458–487, 1995.
E. A. Emerson. Temporal and Modal Logic. Handbook of Theoretical Computer Science, volume B, chapter 16. Elsevier Science Publishers B.V., 1990.
E.A. Emerson and J.Y. Halpern. “Sometimes” and “Not Never” revisited: on branching time versus linear time temporal logic. Journal of ACM 33 (1), pp.151–178, 1986.
E.A. Emerson, A.K. Mok, A.P. Sistla and J. Srinivasan. Quantitative Temporal Reasoning. 2nd CAV, LNCS 531, Springer-Verlag, 1990.
E.A. Emerson and J. Srinivasan. Branching time temporal logic. LNCS 354, pp.123–172. Springer-Verlag, 1989.
G-L. Ferrari and U. Montanari. Dynamic matrices and the cost analysis of concurrent programs. AMAST'95 936, pp.307–321, 1995.
R. Gorrieri, M. Roccetti, and E. Stancampiano. A theory of processes with durational actions. TCS, 140 (1), pp.73–94, 1995.
E. Harel, O. Lichtenstein and A. Pnueli. Explicit Clock Temporal Logic. 5th IEEE LICS, 1990.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM, 32 (1), pp.137–161, 1985.
U. Holmer, K. Larsen and W. Yi. Deciding Properties of Regular Real Timed Processes. CAV'91 575, pp.443–453, 1991.
Z. Manna and A. Pnueli. The anchored version of the temporal framework. LNCS 354, pp.201–284, Springer-Verlag, 1989.
R. Milner. Communication and Concurrency. Prentice Hall International, 1989. International Series on Computer Science.
A. Pnueli. The Temporal Logic of Programs. IEEE FOCS'77, 1977.
C. Stirling. Modal and temporal logics. Handbook of Logic in Computer Science, 2, pp.477–563. Oxford University Press, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X.J., Corradini, F. (1997). On the specification and verification of performance properties for a timed process algebra. In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000467
Download citation
DOI: https://doi.org/10.1007/BFb0000467
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63888-9
Online ISBN: 978-3-540-69661-2
eBook Packages: Springer Book Archive