Decidability of bisimulation equivalences for parallel timer processes

  • Kārlis Čerāns
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 663)


In this paper an abstract model of parallel timer processes (PTPs), allowing specification of temporal quantitative constraints on the behaviour of real time systems, is introduced. The parallel timer processes are defined in a dense time domain and are able to model both concurrent (with delay intervals overlapping on the time axis) and infinite behaviour. Both the strong and weak (abstracted from internal actions) bisimulation equivalence problems for PTPs are proved decidable. It is proved also that, if one provides the PTP model additionally with memory cells for moving timer value information along the time axis, the bisimulation equivalence (and even the vertex reachability) problems become undecidable.


Real Time System Label Transition System Uniform Mapping Counter Machine Current Digit 
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.


  1. [AD90]
    R. Alur and D. Dill, Automata for Modelling Real-Time Systems, LNCS No. 443, 1990.Google Scholar
  2. [ACD90]
    R. Alur, C. Courcoubetis and D. Dili, Model-Checking for Real-Time Systems, Proceedings from LICS'90 pp. 414–425, 1990.Google Scholar
  3. [ABBCK91]
    A. Auziņš, J. Bārzdiņš, J. Bičevskis, K. Čerāns and A. Kalniņš, Automatic Construction of Test Sets: Theoretical Approach, Baltic Computer Science, LNCS, No. 502, 1991.Google Scholar
  4. [BM83]
    B. Berthomieu and M.Menasche, An Enumerative Approach for Analyzing Time Petri Nets, Proc. IFIP Congress, 1983, North-Holland, 1983.Google Scholar
  5. [CC88]
    CCITT Specification and Description Language (SDL), Recomendations Z.100, 1988.Google Scholar
  6. [Cer91]
    K. Čerāns, Decidability of Bisimulation Equivalence for Parallel Timed Processes, in Proc. of Chalmers Workshop on Concurrency, Göteborg, Report PMG-R63, Chalmers University of Technology, 1992.Google Scholar
  7. [Cer92a]
    K. Čerāns, Feasibility of Finite and Infinite Paths in Data Dependent Programs, in Proc. for LFCS'92, Russia, Tver, LNCS No. 620, 1992.Google Scholar
  8. [Cer92b]
    K. Čerāns, Decidability of Bisimulation Equivalences for Processes with Parallel Timers, Technical report, Institute of Mathematics and Computer Science, University of Latvia, Riga, 1992.Google Scholar
  9. [Cer92c]
    K. Čerāns, Algorithmic Problems in Analysis of Real Time System Specifications, Dr.Sc.comp theses, University of Latvia, Riga, 1992.Google Scholar
  10. [Che91]
    L. Chen, Decidability and Completeness in Real Time Processes, LFCS, Edinburgh University, 1991.Google Scholar
  11. [GMMP89]
    C.Ghezzi, D.Mandrioli, S.Morasca and M.Pezze A General Way To Put Time in Petri Nets, ACM SIGSOFT Eng. Notes, Vol. 14, No. 3, 1989.Google Scholar
  12. [HLW91]
    U. Holmer, K.Larsen and Yi Wang, Deciding Properties for Regular Real Timed Processes, CAV'91, 1991.Google Scholar
  13. [Lar92]
    K.G.Larsen, Efficient Local Correctness Checking, this Workshop, 1992.Google Scholar
  14. [MF76]
    P. Merlin and D.J. Farber, Recoverability of Communication Protocols, IEEE Trans. on Communication Protocols, Vol. COM-24, No. 9, 1976.Google Scholar
  15. [NSY91]
    X.Nicollin, J.Sifakis and S.Yovine, From ATP to Timed Graphs and Hybrid Systems, in Proc. of REX Workshop ”Real-Time: Theory in Practice”, 1991.Google Scholar
  16. [RR86]
    G.M. Reed and A.W. Roscoe, A Timed Model for Communicating Sequential Processes, LNCS No. 226, 1986.Google Scholar
  17. [Wan90]
    Yi Wang, Real Time Behaviour of Asynchronous Agents, LNCS No. 458, 1990.Google Scholar
  18. [Wan91]
    Yi Wang, CCS + Time = an Interleaving Model for Real Time Systems, ICALP'91, Madrid, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Kārlis Čerāns
    • 1
  1. 1.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia

Personalised recommendations