Extending process languages with time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1349, Issue , 1997, Pages 524-538

  Ulidowski, Irek ^a   Yuen, Shoji ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SEMANTICS; SOFTWARE ENGINEERING;

CONCURRENT SYSTEMS; DISCRETE TIME; NEW APPLICATIONS; OTHER PROPERTIES; PROCESS LANGUAGES; STRUCTURAL OPERATIONAL SEMANTICS; UNIFORM FRAMEWORK; WEAK BISIMULATION;

SYSTEMS ENGINEERING;

EID: 84947938368     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0000494     Document Type: Conference Paper

References (33)

1. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225-241, 1987.
2. L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. Information and Computation, 111:1-52, 1994.
3. J.C.M Baeten and J.A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3:142-188, 1991.
4. J.C.M Baeten and J.A. Bergstra. Discrete time process algebra. Formal Aspects of Computing, 8:188-208, 1996.
5. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of ACM, 42(1):232-268, 1995.
6. B. Bloom. Structural operational semantics for weak bisimulations. Theoretical Computer Science, 146:27-68, 1995.
7. J.C.M Baeten and W.P Weijland. Process Algebra, volume 18. Cambridge Tracts in Theoretical Computer Science, 1990.
8. J.F. Groote. Specification and verification of real time systems in ACP. In L. Logrippo, L.R. Probert, and H. Ural, editors, Proceedings of PSTV’90, Ottawa, 1990.
9. M. Hennessy. Timed process algebras: A tutorial. Technical Report 2/93, Dept. of Computer Science, University of Sussex, 1993.
10. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
11. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117:221-239, 1995.
12. A. Jeffrey. A hnear time process algebra. In K.G. Larsen and A. Skou, editors, Proceedings of CAV’91, Aalborg, 1991. Springer-Verlag. LNCS 575.
13. L. Léonard and G. Leduc. An introduction to ET-LOTOS for the description of time-sensitive systems. Computer Networks and ISDN Systems, 29(3):271-292, 1997.
14. R. Milner. A modal characterisation of observable machine behaviours. In G. Astesiano and C. Böhm, editors, CAAP 81, Berlin, 1981. Springer-Verlag. LNCS 112.
15. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
16. F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of CONCUR’90, Amsterdam, 1990. Springer-Verlag. LNCS 458.
17. F. Moller and C. Tofts. Relating processes with respect to speed. In J.C.M. Baeten and J.F. Groote, editors, Proceedings of CONCUR'91, Amsterdam, 1991. Springer-Verlag. LNCS 527.
18. X. Nicollin, J.-L. Richier, J. Sifakis, and J. Voiron. ATP: an algebra for timed processes. In Proceedings of the IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Galilea, 1990.
19. X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In K.G. Larsen and A. Skou, editors, Proceedings of CAV’91, Aalborg, 1991. Springer-Verlag. LNCS 575.
20. X. Nicollin and J. Sifakis. The algebra of timed processes, ATP: Theory and application. Information and Computation, 114:131-178, 1994.
21. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
22. I.C.C. Phillips and I. Ulidowski. Stable and timed formats for process algebra. Technical Report, Imperial College, 1995.
23. G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249-261, 1988.
24. S. A. Schneider. An operational semantics for timed CSP. Information and Computation, 116:193-213, 1995.
25. I. Ulidowski. Local Testing and Implementable Concurrent Processes. PhD thesis, Imperial College, University of London, 1994.
26. I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. In M. Wirsing and M. Nivat, editors, Proceedings of AMAST’96, M/inchen, 1996. Springer. LNCS 1101.
27. I. Ulidowski and I.C.C. Phillips. Formats of ordered SOS rules with silent actions. In M. Bidoit and M. Dauchet, editors, Proceedings of TAPSOFT’9Z Lille, 1997. Springer. LNCS 1214.
28. I. Ulidowski and S. Yuen. Towards general timed process languages. Available at http://www.kurims.kyoto-u.ac.jp/~irek/.
29. R.J. Van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. In G.X. Ritter, editor, Information Processing 89, pages 613-618. Elsevier Science Publishers, 1989. To appear in JACM.
30. D. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, 1990.
31. Y. Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, G6teborg, 1991.
32. W.P. Weijland. Synchrony and Asynchrony in Process Algebra. PhD thesis, University of Amsterdam, 1989.
33. ISO/IEC JTC1/SC21 WG7. Working Draft on Enhancements to LOTOS. ftp://ftp.dit.upm.es/pub/lotos/elotos/Working.Docs/cd.ps, 1997.