Article View: comp.specification.z
Article #48Z and Concurrency
From: song
Date: Fri, 14 Aug 1992 09:15
Date: Fri, 14 Aug 1992 09:15
25 lines
1351 bytes
1351 bytes
Z, VDM, state machines are state based languages CSP, CCS, LOTOS are event based languages Petri nets are state-event based languages Combining Z and CSP means that you can have either states or events in the language, which are sometimes useful. But I wonder why we cannot define concurrency operators, trace, process by using Z and then use these highlevel constructs to define concurrent systems. In fact B. Sufrin and Jifeng He have already made some efforts on this. See Specification, analysis and refinement of interactive processes in Formal Methods in Human-Computer Interaction, Ed. M. Harrison and H. Thimbleby. Same argument goes to CSP, why we cannot extend state into CSP. It is useful to view the state of systems so that you can know ,e.g. how many products in buffersm how many machines in use. ===================================== J. Song Dept. of Computer Science University of York Concurrency is the best resources Heslington York, YO1 5DD ======================================
Technical Details
Message-ID:
<713783720.16967@minster.york.ac.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!yorkohm!minster!songShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!yorkohm!minster!song From: song@minster.york.ac.uk Newsgroups: comp.specification.z Subject: Z and Concurrency Message-ID: <713783720.16967@minster.york.ac.uk> Date: 14 Aug 92 09:15:21 GMT Organization: Department of Computer Science, University of York, England Lines: 25