Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Relation-based semantics for concurrency

From MaRDI portal
Publication:1328556
Jump to:navigation, search

DOI10.1016/0020-0255(93)90056-RzbMath0830.68080OpenAlexW2066492767MaRDI QIDQ1328556

Yahya Slimani, Noureddine Boudriga, Ali Milli

Publication date: 14 November 1995

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90056-r


zbMATH Keywords

concurrent programscompositionalitymodularitydeadlocksaxiomaticsconcurrency semantics


Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)




Cites Work

  • Unnamed Item
  • Relational heuristics for the design of deterministic programs
  • A calculus of communicating systems
  • An axiomatic proof technique for parallel programs
  • Monitors
  • The structure of the “THE”-multiprogramming system
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1328556&oldid=13456651"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki