A specification structure for deadlock-freedom of synchronous processes
From MaRDI portal
Publication:1960536
DOI10.1016/S0304-3975(98)00189-3zbMath0932.68061OpenAlexW1987454422WikidataQ57006773 ScholiaQ57006773MaRDI QIDQ1960536
Samson Abramsky, Rajagopal Nagarajan, Simon J. Gay
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00189-3
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Constructing process categories ⋮ A specification structure for deadlock-freedom of synchronous processes
Uses Software
Cites Work
- Linear logic
- Linear logic, coherence and dinaturality
- Computational interpretations of linear logic
- An extensional treatment of dataflow deadlock
- Coherence for compact closed categories
- Domain theory in logical form
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- New foundations for the geometry of interaction
- Proofs as processes
- Relational properties of domains
- A specification structure for deadlock-freedom of synchronous processes
- A Theory of Communicating Sequential Processes
- Process Algebra
- *-Autonomous categories and linear logic
- Games and full completeness for multiplicative linear logic
- Parametricity and local variables
- Traced monoidal categories
- Generic Programming
- Retracing some paths in process algebra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
