Relating may and must testing semantics for discrete timed process algebras

  1. Díaz, L.F.L.
  2. de Frutos Escrig, D.
Book Series:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISSN: 1611-3349,  0302-9743

ISBN: 9783540668565

Year of publication: 1999

Volume: 1742

Pages: 74-86

Type: Conference paper

DOI: 10.1007/3-540-46674-6_8 GOOGLE SCHOLAR
Data source: Scopus