Abstract
The testing methodology is both appealingly simple and powerful as a way of analysing the behaviour of processes. In this paper we extend it in three ways.
Firstly we show how to incorporate the testing methodology into models where the notion of observation is central, rather than that of participation; we do this by introducing the notion of betting. This gives us a testing paradigm for true concurrency models such as event structures.
Secondly we introduce various timed bets to extend the methodology to timed models. An intuitively attractive semantics that admits a clear notion of rapidity of response is obtained.
Thirdly we show how bets can be extended to causal bets that allow us to reason about the causal behaviour of systems. The assumption that causality is observable is a strong one, but it may be justified if we read ‘concurrent’ as ‘physically distributed’.
Finally we classify the various betting semantics, presenting a hierarchy of semantics of increasing power. The semantics are presented with respect to a timed event structure model; they could, however, be applied to any (timed) causal model.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
S. Abramsky, Observational Equivalence is Testing Equivalence, Theoretical Computer Science, Volume 53 (1987), Pp. 225–241.
L. Aceto, R. de Nicola, and A. Fantechi, Testing Equivalence for Event Structures, in Mathematical Models for the Semantics of Parallelism (M. Venturini-Zilli, Ed.), (1987), Springer-Verlag LNCS 280.
L. Aceto and M. Hennessy, Towards action-refinement in Process Algebra, Technical Report 3/88, Department of Computer Science, University of Sussex, 1988.
B. Bloom and A. Meyer, Experimenting with Process Equivalence, in Semantics for Concurrency, (1990), Springer-Verlag Workshops in Computing.
J. Davies and S. Schneider, An introduction to timed CSP, Technical Report Number 75, Oxford University Computing Laboratory, 1989.
P. Degano and U. Montanari, Concurrent Histories: A basis for observing distributed systems, Journal of Computer Systems Sciences, Volume 34 (1987), Pp. 442–461.
R. Gerth and A. Boucher, A timed failures model for communicating processes, in Automata, Languages and Programming, (1987), Springer-Verlag LNCS 267, (14th Coll.).
J. Gischer, The equational theory of pomsets, Theoretical Computer Science, Volume 61 (1989), Pp. 199–224.
M. Hennessy, Synchronous and asynchronous experiments on processes, Information and Control, Volume 51 (1983), Number 1, Pp. 58–75.
M. Hennessy and T. Regan, A Temporal Process Algebra, Technical Report 2/90, Department of Computer Science, University of Sussex, 1990.
C. Hoare, Communicating Sequential Processes, International series on computer science, Prentice-Hall, 1985.
M. Joseph and A. Goswami, Relating Computation and Time, Technical Report RR 138, Department of Computer Science, University of Warwick, 1985.
L. Lamport, On interprocess communication. Part I: Basic formalism, Distributed Computing, Volume 1 (1986), Pp. 77–85.
D. Murphy, Time, causality, and concurrency, Ph.D. thesis, Department of Mathematics, University of Surrey, 1989, Available as Technical Report CSC 90/R32, Department of Computing Science, University of Glasgow.
—, A Functorial Semantics of Timed Concurrency, In preparation, 1991.
—, Three papers on classical concurrency theory, Technical Report CSC 91/R5, Department of Computing Science, University of Glasgow, 1991.
W. Reisig, A Strong Part of Concurrency, in Advances in Petri Nets (G. Rozenberg, Ed.), (1987), Springer-Verlag LNCS 266.
M. Roncken and R. Gerth, A Denotational Semantics for Synchronous and Asynchronous Behaviour with Multiform Time, in Semantics for Concurrency (M. Kwiatkowska, M. Shields, and R. Thomas, Eds.), (1990), Springer-Verlag Workshops in Computing, Leicester, 1990.
A. Schettini and J. Winkowsi, Towards an algebra for timed behaviours, Technical report, Institute of Computer Science, Polish Academy of Sciences, 1990, To appear in Theoretical Computer Science.
G. Winskel, An introduction to Event Structures, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J. de Bakker, W. de Roever, and G. Rozenberg, Eds.), (1989), Springer-Verlag LNCS 354, Proceedings of REX 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murphy, D. (1991). Testing, betting and timed true concurrency. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_105
Download citation
DOI: https://doi.org/10.1007/3-540-54430-5_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54430-2
Online ISBN: 978-3-540-38357-4
eBook Packages: Springer Book Archive