E. Brinksma, G. Scollo, and S. Steenbergen, “LOTOS Specifications, Their Implementations and Their Tests,”Protocol Specification, Testing, and Verification, Sarikaya and Bochmann (eds.), Montréal, Canada, June 1986.
S.D. Brookes and A.W. Roscoe, “An Improved Failure Model for Communicating Sequential Processes,”Proceedings of the NSF-SERC Seminar on Concurrency, Springer-Verlag LNCS 197, 1985.
R. De Nicola,and M. Hennessy, “Testing equivalences for processes,”Theo. Comp. Sci.
, 34:83–133, 1984.Google Scholar
R. De Nicola, “Extensional Equivalences for Transition Systems,”Acta Informatica
, 24:211–237, 1987.Google Scholar
R. Cleaveland and M. Hennessy, “Testing Equivalence as Bisimulation Equivalence,”Formal Aspects of Computing
, 5:1–20, 1993.Google Scholar
K. Drira, “Tranformation et composition de graphes de refus: analyse de la testabilité,” Doctorat Thesis, Université de Toulouse, 1992.
M. Hennessy, “Acceptances Trees,”J. of ACM
, Vol. 32, No. 4:896–928, Oct. 1985.Google Scholar
M Hennessy,Algebraic Theory for Processes
, MIT Press, Cambridge, 1988.Google Scholar
J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, p. 418, 1979.
H. Ichikawa, K. Yamanaka, and J. Kato, “Incremental Specification in LOTOS,”Symposium on Protocol Specification, Testing and Verification X (1990), Ottawa, Canada, Logrippo, Probert and Ural (eds.).
ISO—Information Processing Systems—Open Systems Interconnection, LOTOS—A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, DIS 8807, 1987.
F. Khendek and G.v. Bochmann, “Incremental Construction Approach for Distributed System Specifications,”Proceedings of the Int. Symp. on Formal Description Techniques, Boston, Mas., 26–29 Oct., 1993.
G. Leduc, “On the role of Implementation Relations in the Design of Distributed systems using LOTOS,” Doctoral Dissertation, Liège, Belgium.
R. Keller, “Formal verification of parallel programs,”Comm. of the ACM 19
, pp. 371–384, July 1976.Google Scholar
H.A. Lin, “Constructing Protocols with Alternative Functions,”IEEE Transactions on Computer, Vol. 40, No. 4, April 1991.
T. Mayr,Specification of object-oriented systems in LOTOS
, FORTE, Stirling, 1988.Google Scholar
R. Milner,Communication and Concurrency, Prentice-Hall, 1989.
D. Park, “Concurrency and Automata in Infinite Strings,” Lecture Notes in Computer Science 104, Springer-Verlag, Berlin, 1981, pp. 67–183.Google Scholar
S. Rudkin,Inheritance in LOTOS, Formal description technique—FORTE, Sydney, Australia, 1991, pp. 415–430.