Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Communicating sequential processes
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Primitives === CSP provides two classes of primitives in its process algebra: events and primitive processes. ;Events Events represent communications or interactions. They are assumed to be instantaneous, and their communication is all that an external ‘environment’ can know about processes. An event is communicated only if the environment allows it. If a process does offer an event and the environment allows it, then that event ''must'' be communicated. Events may be atomic names (e.g. {{mvar|on}}, {{mvar|off}}), compound names (e.g. {{mvar|valve.open}}, {{mvar|valve.close}}), or input/output events (e.g. {{mvar|mouse?xy}}, {{mvar|screen!bitmap}}). The set of all events is denoted <math>\Sigma</math>.<ref name="ucs">{{cite book |last1=Roscoe |first1=A.W. |date=2010 |title=Understanding Concurrent Systems |series=Texts in Computer Science |doi=10.1007/978-1-84882-258-0 |isbn=978-1-84882-257-3 }}</ref> ;Primitive processes Primitive processes represent fundamental behaviors: examples include <math>\mathrm{STOP}</math> (the process that immediately deadlocks), and <math>\mathrm{SKIP}</math> (the process that immediately terminates successfully).<ref name="ucs"/>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)