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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Aceto, A. Burgueño, and K.G. Larsen, “Model checking via reachability testing for timed automata,” in Proceedings of TACAS'98, Lecture Notes in Computer Science 1384, pp. 263–280, 1998.
R. Alur and T.A. Henzinger, “Logics and models of real time: Asurvey,” in Proceedings of Real-Time: Theory in Practice, Lecture Notes in Computer Science 600, pp. 74–106, 1991.
R. Alur and T.A. Henzinger, “A really temporal logic,” J. ACM, Vol. 41, No. 1, pp. 181–204, 1994.
R. Barbuti, N. De Francesco, A. Santone, and G. Vaglini, “Selective mu-calculus: New modal operators for proving properties on reduced transition systems,” in '97. Chapman & Hall, pp. 519–534, 1997.
R. Barbuti, N. De Francesco, A. Santone, and G. Vaglini, “Selective mu-calculus and formula-based equivalence of transition systems,” Journal of Computer and System Sciences, Vol. 59, No. 3, pp. 537–556, 1999.
S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis, “Property preserving simulations,” in Proceedings of Workshop on Computer Aided Verification (CAV'92), Lecture Notes in Computer Science 663, pp. 260–273, 1992.
J. Bradfield and C. Stirling, “Verifying temporal properties of processes,” in Proceedings of International Conference on Concurrency Theory (CONCUR'90), Lecture Notes in Computer Science 458, pp. 115–125, 1990.
E.M. Clarke, E.A. Emerson, and A.P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic verification,” ACMTransactions on Programming Languages and Systems,Vol. 8, pp. 244–263, 1986.
E.M. Clarke, O. Grumberg, and D.E. Long, “Model checking and abstraction,” ACM Transactions on Programming Languages and Systems, Vol. 16, pp. 343–354, 1992.
R. Cleaveland and S. Sims, “The NCSU concurrency workbench,” in Proceedings of Workshop on Computer Aided Verification (CAV'96), Lecture Notes in Computer Science 1102, pp. 394–397, 1996.
D. Dams, O. Grumberg, and R. Gerth, “Generation of reduced models for checking fragments of CTL,” in Proceedings ofWorkshop on Computer Aided Verification (CAV'93), Lecture Notes in Computer Science 697, pp. 479–490, 1993.
D. Dams, O. Grumberg, and R. Gerth, “Abstract interpretation of reactive systems,” ACM Transaction of Programming Languages and Systems, Vol. 19, pp. 253–291, 1997.
R. De Simone and D. Vergamini, “Aboard AUTO,” INRIA Technical Report 111, 1989.
E.A. Emerson, “Real-time and the mu-calculus,” in Proceedings of Real-Time: Theory in Practice, Lecture Notes in Computer Science 600, pp. 176–194, 1991.
E.A. Emerson and R.F. Trefler, “Generalized quantitative temporal reasoning: An automata-theoretic approach,” in Proceedings of TAPSOFT'97, Lecture Notes in Computer Science 1214, pp. 189–200, 1997.
J.C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu, “CADP A protocol validation and verification toolbox,” in Proceedings of the Third International Conference on Computer-Aided Verification, Lecture Notes in Computer Science 1102, pp. 437–440, 1996.
G. Juanole and L. Gallon, “Concept of quantified abstract quotient automaton and its advantage,” in '97, Chapman & Hall, pp. 223–238, 1997.
T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” Information and Computation, Vol. 111, pp. 193–244, 1994.
D. Kozen, “Results on the propositional mu-calculus,” Theoretical Computer Science, Vol. 27, pp. 333–354, 1983.
F. Laroussinie, K.G. Larsen, and C. Weise, “From timed automata to logic–and back,” in Proceedings of MFCS'95, Lecture Notes in Computer Science 969, pp. 529–538, 1995.
R. Milner, Communication and Concurrency, Prentice-Hall, 1989.
X. Nicollin and J. Sifakis, “The algebra of timed processes, ATP: Theory and application,” Information and Computation, Vol. 114, pp. 131–178, 1994.
O.V. Sokolsky and S.A. Smolka, “Local model checking for real-time systems,” in Proceedings of Workshop on Computer Aided Verification (CAV'95), Lecture Notes in Computer Science 939, pp. 211–224, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barbuti, R., De Francesco, N., Santone, A. et al. Logic Based Abstractions of Real-Time Systems. Formal Methods in System Design 17, 201–220 (2000). https://doi.org/10.1023/A:1026534200187
Issue Date:
DOI: https://doi.org/10.1023/A:1026534200187