In this article, we present semantic translations for the actions of μDemos, a proocess-based, discrete event simulation language. Our formal translation schema permits the automatic construction of a process algebraic representatioon of the underlying simulation model which can then be checked for freedom from deadlock and livelock, as well as system-specific safety and liveness properties. As simulation methodologies are increasingly being used to design and implement complex systems of interaction objects, the ability to perform such verifications in of increasing methodological importance. We also present a normal form for the syntactic construction of μDemos programs that allows for the direct comparison of such programs (two programs with the same normal form must execute in identical fashion), reduces model proof obligations by minimizing the number of language constructs, and permits an implementer to concentrate on the basic features of the language (since any program implementation that efficiently evaluates normal forms will be an efficient evaluator for the complete language).
[1]
Faron Moller,et al.
A Temporal Calculus of Communicating Systems
,
1990,
CONCUR.
[2]
Colin Stirling,et al.
Modal Logics for Communicating Systems
,
1987,
Theor. Comput. Sci..
[3]
Robin Milner,et al.
Communication and concurrency
,
1989,
PHI Series in computer science.
[4]
Graham Birtwistle,et al.
Discrete event modelling on SIMULA
,
1987
.
[5]
Colin Stirling,et al.
Modal and Temporal Logics for Processes
,
1996,
Banff Higher Order Workshop.
[6]
Somesh Jha,et al.
Verification of the Futurebus+ cache coherence protocol
,
1993,
Formal Methods Syst. Des..
[7]
Somesh Jha,et al.
Verification of the Futurebus+ cache coherence protocol
,
1993,
Formal Methods Syst. Des..
[8]
Glynn Winskel,et al.
CCS with Priority Choice
,
1995,
Inf. Comput..
[9]
Robin Milner,et al.
A Calculus of Communicating Systems
,
1980,
Lecture Notes in Computer Science.