NAPAW 92 pp 13-26 | Cite as

Modal Logics in Timed Process Algebras

  • Luboš Brim
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


Processes of timed process algebras may be modelled as timed transition systems. A timed transition system is a labelled transition system whose sort is timed, that is labels are either action labels or elements from a time domain.

Modal logics can be used to express properties of transition systems. Timed modal logics are modal logics whose sort is timed. hi this paper we consider timed propositional modal logic and timed modal μ-calculus. Definability of important timed properties is the main body of the paper. The properties under consideration include time determinism, time additivity, maximal progress and finite variability.

Finally, minimal timed logics for the classes of time deterministic and time additive transition systems are chracterised axiomatically.


Modal Logic Transition System Operational Semantic Axiom System Label Transition 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]
    Bolognesi, T. and Lucidi, F.: LOTOS-like process algebra with urgent or timed interactions. In Proc. REX Workshop “Real-Time: Theory in Practice”. Mook, the Netherlands, 1991.Google Scholar
  2. [2]
    Bradfield, J.: Verifying Temporal Properties of Systems. Birkhâuser, 1992.Google Scholar
  3. [3]
    Bradfield, J. and Stirling, C.: Verifying temporal properties of processes. Springer-Verlag, LNCS 485, 1990.Google Scholar
  4. [4]
    Brim, L.: Analyzing Time Aspects of Dynamic Systems. EMCSR’92, Vienna, Austria, April 1992.Google Scholar
  5. [5]
    Davis, J. and Schneider, S.: An Introduction to Timed CSP. Technical Monograph PRG-75, Oxford University, UK, 1989.Google Scholar
  6. [6]
    Hennessy, M. and Regan, T.: A Temporal Process Algebra. Technical Report 2/90, University if Sussex, UK, 1990.Google Scholar
  7. [7]
    Hennessy, M. and Regan, T.: A Process Algebra for Timed Systems. Technical Report 5/91, University if Sussex, UK, 1991.Google Scholar
  8. [8]
    Kozen, D.: Results on the propositional mu-calculus. TCS 27, 1983.Google Scholar
  9. [9]
    Manna, Z. and Pnueli, A.: The anchored version of the temporal framework., Springer-Verlag, LNCS 354, 1989.Google Scholar
  10. [10]
    Moller, F. and Tofts, C.: A Temporal Calculus of Communicating Systems. University of Edinburgh, Report No. LFCS-89–104, 1989.Google Scholar
  11. [11]
    Nicollin, X. and Sifakis, J.: The algebra of timed processes ATP: Theory and Application. Technical Report RT-C26, Laboratoire de Génie Informatique de Grenoble, 1990.Google Scholar
  12. [12]
    Nicollin, X. and Sifakis, J.: An Overview and Synthesis on Timed Process Algebras. CAV’91, Alborg, Denmark, July 1991. Springer-Verlag, LNCS 391, 1989.Google Scholar
  13. [13]
    Reed, G.M. and Roscoe, A.W.: A timed model for Communicating Sequential Processes. TCS, 58, 1988.Google Scholar
  14. [14]
    Schneider, S.: An Operational Semantics for Timed CSP. Technical Report PRG, Oxford University, UK, 1991.Google Scholar
  15. [15]
    Stirling, C.: An Introduction to Modal and Temporal Logics for CCS.Google Scholar
  16. [16]
    Wang Yi: Real-time behaviour of asynchronous agents. In proc. CONCUR’90, LNCS 458, 1990.Google Scholar

Copyright information

© British Computer Society 1993

Authors and Affiliations

  • Luboš Brim
    • 1
  1. 1.Department of Computing ScienceMasaryk UniversityBrnoCzechoslovakia

Personalised recommendations