Discrete event modelling on SIMULA
Discrete event modelling on SIMULA
Modal logics for communicating systems
Theoretical Computer Science
Communication and concurrency
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
An efficient global convergence detection scheme for parallel algorithms on transputer networks
OUG-12 Proceedings of the 12th Occam User Group technical meeting on Tools and techniques for transputer applications
A synchronous calculus of relative frequency
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Verification of the Futurebus+ cache coherence protocol
Formal Methods in System Design - Special issue on symbolic model checking
A Calculus of Communicating Systems
A Calculus of Communicating Systems
General distributions in process algebra
Lectures on formal methods and performance analysis
A theory of stochastic systems: part II: process algebra
Information and Computation
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Semantics for structured systems modelling and simulation
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
ConceVE: Conceptual modeling and formal validation for everyone
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
In this article, we present semantic translations for the actions of &mgr;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 &mgr;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).