SPADES - a process algebra for discrete event simulation

Journal of Logic and Computation

Volumn 10, Issue 1, 2000, Pages 3-42

  Harrison, Peter G ^a   Strulo, Ben ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b MARTLESHAM HEATH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES;

DISCRETE EVENT SIMULATION; PROCESS ALGEBRA;

ALGEBRA;

EID: 0033877460     PISSN: 0955792X     EISSN: None     Source Type: None    
DOI: 10.1093/logcom/10.1.3     Document Type: Article

References (36)

1. J. C. M. Baeten and J. A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3, 142-188, 1991.
2. M. Bernardo and R. Gorrieri. Extended Markovian process algebra. In Proceedings of CONCUR '96, LNCS 1119, Springer-Verlag, 1996.
3. M. Bernardo, M. Bravetti and R. Gorrieri. Towards performance evaluation with general distributions in process algebras. In Proceedings of CONCUR '98, LNCS 1466, pp. 405-422, Springer-Verlag, 1998.
4. L. Chen. An interleaving model for real-time systems. In Proceedings of Logical Foundations of Computer Science (Tver '92), A. Nerode and M. Taitslin, eds. pp. 81-92. LNCS 620, Springer-Verlag, 1992.
5. L. Chen. Timed processes: models, axioms and decidability. LFCS report ECS-LFCS-93-271 (also CST-101-93), University of Edinburgh, 1993.
6. P. D'Argenio, J.-P. Katoen and E. Brinksma. General purpose discrete event simulation using spadesuit sign. In Proceedings of the 6th Workshop on Process Algebra and Performance Modelling, PAPM '98, pp. 85-102, 1998.
7. A. J. Field and P. G. Harrison. Functional Programming. Addison Wesley, 1988.
8. N. Götz, U. Herzog and M. Rettelbach. TIPP - a language for timed processes and performance evaluation. Technical Report 4/92 1MMD7, University of Erlangen-Nürnberg, November 1992.
9. H. A. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
10. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117, 221-239, 1995.
11. H. Hermanns and M. Rettlebach. Syntax, Semantics, Equivalences and Axioms for MTIPP In Proceedings of the 2nd Workshop on Process Algebra and Performance Modelling, PAPM '94, 1994.
12. H. Hermanns and M. Rettlebach. Towards a superset of basic lotos for performance prediction. In Proceedings of the 4th Workshop on Process Algebra and Performance Modelling, PAPM '96, 1996.
13. H. Hermanns, M. Rettelbach and T. Weiss. Formal characterisation of immediate actions in SPA with nondeterministic branching. The Computer Journal, 38, 530-541, 1995.
14. J. Hillston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994.
15. D. L. Iglehart and G. S. Shedler. Simulation of non-Markovian systems. IBM Journal of Research and Development, 27, 472-479, 1983.
16. K. Kanani. A Unified Framework for Systematic Quantitative and Qualitative Analysis of Communicating Systems. PhD thesis, Imperial College of Science, Technology and Medicine. University of London, August 1998.
17. J.-P. Katoen, P. R. D'Argenio and E. Brinksma. A stochastic automata model and its algebraic approach. Ctit technical report, Process Algebra and Performance Modelling, Fifth International Workshop, University of Twente, June 1997.
18. L. Léonard and G. Leduc. An introduction to et-lotos for the description of time-sensitive systems. Computer Networks and ISDN Systems, 29, 271-292, 1997.
19. M. Loève. Probability Theory. Van Nostrand, 1963.
20. C. Miguel, A. Fernández and L. Vidaller. A LOTOS based performance tool. Computer Networks and ISDN Systems, 25, 791-814, 1993.
21. R. E. Milne and C. Strachey. A Theory of Programming Language Semantics. Chapman and Hall, 1976.
22. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
23. F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proceedings of CONCUR '90: Theories of Concurrency: Unification and Extension, J. C. M. Baeten and J. W. Klop, eds. pp. 401-415. LNCS 458, Springer-Verlag, 1990.
24. F. Moller and C. Tofts. Behavioural abstraction in TCCS. In Proceedings of the 19th Colloquium on Automata Languages and Programming, pp. 579-570. LNCS 623, Springer-Verlag, 1992.
25. X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Proceedings of CAV 91, K. G. Larsen and A. Skou, eds. pp. 376-398. LNCS 575, Springer-Verlag, 1991.
26. I. Phillips. Refusal testing. Theoretical Computer Science, 50, 241-284, 1987.
27. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proceedings of the Twelfth Colloquium on Automata Languages and Programming, LNCS 194, Springer-Verlag, 1985.
28. C. Priami. Stochastic π-calculus. The Computer Journal, 38, 1995.
29. C. Priami. Stochastic π-calculus with General Distributions. In Proceedings of the 4th Workshop on Process Algebra and Performance Modelling, PAPM '96, 1996.
30. S. Schneider. An operational semantics for timed CSP. Information and Computation, 116, 193-213, 1995.
31. G. S. Shedler. Regenerative Stochastic Simulation. Academic Press, 1993.
32. B. Strulo. Process algebra for discrete event simulation. PhD thesis, Imperial College of Science, Technology and Medicine. University of London, October 1993.
33. B. Strulo and P. Harrison. Stochastic process algebra for discrete event simulation. In Quantitative Methods in Parallel Systems, Esprit Basic Research Series, pp. 18-37. Springer-Verlag, 1995.
34. Ward Whitt. Continuity of generalized semi-Markov processes. Mathematics of Operations Research, 5, 14-23, 1980.
35. Wang Yi. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, S-412 96 Göteborg, Sweden, 1991.
36. Wang Yi. CCS + Time = an interleaving model for real time systems. In Proceedings of the Eighteenth Colloquium on Automata Languages and Programming, LNCS 510, pp. 217-228, Springer-Verlag, 1991.