Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

A denotational semantics for a process-based simulation language

Published: 01 July 1998 Publication History

Abstract

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).

References

[1]
BIRTWISTLE, G. 1979. Demos--Discrete event modeling on Simula. Macmillan, New York, NY.
[2]
BIRTWISTLE, G. 1981. Demos implementation guide and reference manual. Tech. Rep., 81/70/22, University of Calgary.
[3]
BIRTWISTLE, a. AND TOFTS, C. 1993. An operational semantics of process-orientated simulation languages: Part I ~rDemos. Trans. Soc. Comput. Simul. 10, 4, 299-333.
[4]
BIRTWISTLE, a. AND TOFTS, C. 1994. An operational semantics of process-orientated simulation languages: Part II t~Demos. Trans. Soc. Comput. Simul. 11, 4, 303-336.
[5]
BIRTWISTLE, G., POOLEY, R., AND TOFTS, C. 1993. Characterizing the structure of simulation models in CCS. Trans. Soc. Comput. Simul. 10, 3, 205-236.
[6]
CLARKE, E., GRUMBERG, O., HIRAISHI, H., JHA, S., LONG, D., MCMILLAN, K., AND NESS, L. 1995. Verification of the Futurebus+ cache coherence protocol. Formal Meth. Syst. Des. 6, 2 (March), 217-232.
[7]
MILNER, R. 1980. A Calculus of Communicating Systems. LNCS 92, Springer Verlag, New York, NY.
[8]
MILNER, R. 1990. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ.
[9]
MOLLER, F. 1990. The Edinburgh Concurrency Workbench. Tech. Rep., Department of Computer Science, University of Edinburgh.
[10]
MOLLER, F. AND TOFTS, C. 1990. A temporal calculus of communicating systems. In CON- CUR '90, LNCS 458, Springer-Verlag, New York, NY, 401-405.
[11]
STIRLING, C. 1987. Modal logics for communicating systems. J. Theor. Comput. Sci. 49, 311-347.
[12]
STIRLING, C. 1992. Modal and temporal logics for processes. Tech. Rep. ECS-LFCS-92-221, Department of Computer Science, University of Edinburgh.
[13]
TOFTS, C. 1990. A calculus of relative frequency. In CONCUR '90, LNCS 458, Springer- Verlag, New York, NY, 467-480.
[14]
TOFTS, C. 1994. Processes with probability, priority and time. Form. Asp. Comput. Sci. 6, 5, 536 -564.
[15]
TOFTS, C. AND BIRTWISTLE, G. 1997a. A denotational semantics for Demos: Part I. Tech. Rep. 97, 12, School of Computer Studies, University of Leeds.
[16]
TOFTS, C. AND BIRTWISTLE, G. 1997b. A denotational semantics for Demos: Part II. Tech. Rep. 97, 13, School of Computer Studies, University of Leeds.
[17]
TOFTS, C. AND BIRTWISTLE, a. 1997c. A relationship between an operational and a denotational account of Demos. J. Simul. Pract. Theor. 5, 1, 1-33.
[18]
VAN VLIJMEN, S. F. M. AND VAN WAVEREN, A. 1992. An algebraic specification of a model factory. Tech. Rep., University of Amsterdam Programming Research Group.

Cited By

View all
  • (2014)ConceVEACM Transactions on Modeling and Computer Simulation10.1145/256789724:2(1-17)Online publication date: 1-Feb-2014
  • (2013)The need for usable formal methods in verification and validationProceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World10.5555/2675983.2676142(1257-1268)Online publication date: 8-Dec-2013
  • (2013)The need for usable formal methods in verification and validation2013 Winter Simulations Conference (WSC)10.1109/WSC.2013.6721513(1257-1268)Online publication date: Dec-2013
  • Show More Cited By

Reviews

Robert D. Tennent

The authors describe a formal translation from &mgr;Demos, the kernel of the process-based simulation language Demos, to Milner's CCS process algebra. They call this translation a denotational semantics and claim that it simulates an operational semantics presented in earlier work. The wait-until construction and a conditional branching construction receive detailed attention, leading to a normal form for &mgr;Demos programs. This paper will interest readers who are both familiar with CCS and interested in process-based simulation.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Modeling and Computer Simulation
ACM Transactions on Modeling and Computer Simulation  Volume 8, Issue 3
July 1998
104 pages
ISSN:1049-3301
EISSN:1558-1195
DOI:10.1145/290274
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1998
Published in TOMACS Volume 8, Issue 3

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)49
  • Downloads (Last 6 weeks)8
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2014)ConceVEACM Transactions on Modeling and Computer Simulation10.1145/256789724:2(1-17)Online publication date: 1-Feb-2014
  • (2013)The need for usable formal methods in verification and validationProceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World10.5555/2675983.2676142(1257-1268)Online publication date: 8-Dec-2013
  • (2013)The need for usable formal methods in verification and validation2013 Winter Simulations Conference (WSC)10.1109/WSC.2013.6721513(1257-1268)Online publication date: Dec-2013
  • (2010)Semantics for structured systems modelling and simulationProceedings of the 3rd International ICST Conference on Simulation Tools and Techniques10.4108/ICST.SIMUTOOLS2010.8631(1-8)Online publication date: 15-Mar-2010
  • (2007)Systems Modelling via Resources and ProcessesElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2007.02.020172(545-587)Online publication date: 1-Apr-2007
  • (2006)The Denotational Semantics of the Signal Statement in ATLASProceedings of the Fourth International Conference on Software Engineering Research, Management and Applications10.1109/SERA.2006.66(177-182)Online publication date: 9-Aug-2006
  • (2006)A Calculus and logic of resources and processesFormal Aspects of Computing10.1007/s00165-006-0018-z18:4(495-517)Online publication date: 8-Nov-2006
  • (2005)A theory of Stochastic systems. Part II: Process algebraInformation and Computation10.1016/j.ic.2005.07.002203:1(39-74)Online publication date: Nov-2005
  • (2002)General distributions in process algebraLectures on formal methods and performance analysis10.5555/567305.567316(375-429)Online publication date: 17-Jan-2002
  • (2001)Getting Demos models right. (II) … and theorySimulation Practice and Theory10.1016/S0928-4869(00)00030-68:6-7(395-414)Online publication date: Mar-2001
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media