Decidability of bisimulation equivalences for parallel timer processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 663 LNCS, Issue , 1993, Pages 302-315

  Čerāns, Kārlis ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER AIDED ANALYSIS; EQUIVALENCE CLASSES; INTERACTIVE COMPUTER SYSTEMS; TIMING CIRCUITS;

ABSTRACT MODELING; BISIMULATION EQUIVALENCES; DENSE-TIME; MEMORY CELL; REACHABILITY; TIME AXIS;

REAL TIME SYSTEMS;

EID: 84947796708     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56496-9_24     Document Type: Conference Paper

References (18)

1. R. Alur and D. Dill, Automata for Modelling Real-Time Systems, LNCS No. 443, 1990.
2. R. Alur, C. Courcoubetis and D. Dill, Model-Checking for Real-Time Systems, Proceedings from LICS’90 pp. 414-425, 1990.
3. A. Auziqs, J. Barzdiqs, J. Bicevskis, K. Cerans and A. Kalniqs, Automatic Construction of Test Sets: Theoretical Approach, Baltic Computer Science, LNCS, No. 502, 1991.
4. B. Berthomieu and M. Menasche, An Enumerative Approach for Analyzing Time Petri Nets, Proc. IFIP Congress, 1983, North-Holland, 1983.
5. CCITT Specification and Description Language (SDL), Re-comendations Z.100, 1988.
6. K. Cerans, Decidability of Bisimulation Equivalence for Parallel Timed Processes, in Proc. of Chalmers Workshop on Concurrency, Goteborg, Report PMG-R63, Chalmers University of Technology, 1992.
7. K. Cerans, Feasibility of Finite and Infinite Paths in Data Dependent Programs, in Proc. for LFCS’92, Russia, Tver, LNCS No. 620, 1992.
8. K. Cerans, Decidability of Bisimulation Equivalences for Processes with Parallel Timers, Technical report, Institute of Mathematics and Computer Science, University of Latvia, Riga, 1992.
9. K. Cerans, Algorithmic Problems in Analysis of Real Time System Specifications, Dr.Sc.comp theses, University of Latvia, Riga, 1992.
10. L. Chen, Decidability and Completeness in Real Time Processes, LFCS, Edinburgh University, 1991.
11. 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.
12. U. Holmer, K. Larsen and Yi Wang, Deciding Properties for Regular Real Timed Processes, CAV’91, 1991.
13. K.G. Larsen, Efficient Local Correctness Checking, this Workshop, 1992.
14. P. Merlin and D.J. Farber, Recoverability of Communication Protocols, IEEE Trans, on Communication Protocols, Vol. COM-24, No. 9, 1976.
15. 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.
16. G.M. Reed and A.W. Roscoe, A Timed Model for Communicating Sequential Processes, LNCS No. 226, 1986.
17. Yi Wang, Real Time Behaviour of Asynchronous Agents, LNCS No. 458, 1990.
18. Yi Wang, CCS + Time = an Interleaving Model for Real Time Systems, ICALP’91, Madrid, 1991.