Step semantics for ``true concurrency with recursion
From MaRDI portal
Publication:916408
DOI10.1007/BF01784023zbMath0703.68073MaRDI QIDQ916408
E. P. de Vink, John-Jules Ch. Meyer
Publication date: 1989
Published in: Distributed Computing (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subset languages of Petri nets. I: The relationship to string languages and normal forms
- Specification-oriented semantics for communicating processes
- A formal semantics for concurrent systems with a priority relation
- A theory for nondeterminism, parallelism, communication, and concurrency
- Petri nets with individual tokens
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Semantics of nondeterminism, concurrency, and communication
- A calculus of communicating systems
- A continuous semantics for unbounded nondeterminism
- Power domains
- Process algebra for synchronous communication
- A Powerdomain Construction
- Processes and the denotational semantics of concurrency
This page was built for publication: Step semantics for ``true concurrency with recursion
