A Denotational Semantic Theory of Concurrent Systems

DOI10.1007/978-3-319-23165-5_23zbMath1321.68362OpenAlexW2294833835MaRDI QIDQ2945722

Jayadev Misra

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23165-5_23

zbMATH Keywords

denotational semanticsbismooth transformerfairness and recursionsmooth transformerspecification transformerspecifications of recursive programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Mapping among the nodes of infinite trees: a variation of Kőnig's infinity lemma

Cites Work

• A uniform approach to inductive posets and inductive closure
• A timed semantics of Orc
• Order completion monads
• Mapping among the nodes of infinite trees: a variation of Kőnig's infinity lemma
• A lattice-theoretical fixpoint theorem and its applications
• The Orc Programming Language
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item