Algorithmic problems in analysis of real time system specifications

[1]  O. H. Lowry.  Academic press. , 1972, Analytical chemistry.

[2]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[3]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[4]  Robin Milner,et al.  Edinburgh LCF , 1979, Lecture Notes in Computer Science.

[5]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[6]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[7]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

[8]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[10]  R. Alur,et al.  Automata For Modeling Real-Time Systems , 1990, ICALP.

[11]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[12]  Audris Kalnins,et al.  Automatic Construction of Test Sets: Theoretical Approach , 1991, Baltic Computer Science.

[13]  Karlis Cerans,et al.  Feasibility of Finite and Infinite Paths in Data Dependent Programs , 1992, LFCS.

[14]  Kim G. Larsen,et al.  Efficient Local Correctness Checking , 1992, CAV.

[15]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.