Foundations of Software Science and Computation Structures
DOI10.1007/B95995zbMATH Open1126.68499OpenAlexW3105029025MaRDI QIDQ5308452FDOQ5308452
Andrzej S. Murawski, Dan R. Ghica
Publication date: 28 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95995
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (15)
- Higher-order linearisability
- Asynchronous games. II: The true concurrency of innocence
- Angelic semantics of fine-grained concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- The mays and musts of concurrent strategies
- A graph abstract machine describing event structure composition
- Definability and full abstraction
- Game semantics for access control
- Program verification using symbolic game semantics
- Logic and Geometry of Agents in Agent-Based Modeling
- Automata, Languages and Programming
- Partial Orders, Event Structures and Linear Strategies
- Syntactic control of concurrency
- Game Semantics for Higher-Order Concurrency
This page was built for publication: Foundations of Software Science and Computation Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5308452)