Abstract representation theorems for demonic refinement algebras
DOI10.1016/J.JLAP.2010.07.014zbMATH Open1200.68070OpenAlexW2083577794MaRDI QIDQ604454FDOQ604454
Authors: Jean-Lou De Carufel, Jules Desharnais
Publication date: 11 November 2010
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2010.07.014
Recommendations
- Publication:4865868
- Finite representability of semigroups with demonic refinement
- On the Structure of Demonic Refinement Algebras with Enabledness and Termination
- Representable varieties of algebras
- Representations of derived \(A\)-infinity algebras
- On representation-finite algebras and beyond
- Towards a refinement algebra
- scientific article; zbMATH DE number 179050
- Representations of strongly algebraically closed algebras
- Representation theorems for \(Q\)-algebras
terminationdemonic refinement algebradivergence operatorKleene algebra with domainrepresentation by pairs
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- Relational algebraic semantics of deterministic and nondeterministic programs
- A generalized control structure and its formal definition
- Title not available (Why is that?)
- Title not available (Why is that?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- Towards a refinement algebra
- Title not available (Why is that?)
- Programming as a Discipline of Mathematical Nature
- Kleene algebra with domain
- Kleene getting lazy
- Algebraic Notions of Termination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domain Axioms for a Family of Near-Semirings
- Relational Methods in Computer Science
- Latest News about Demonic Algebra with Domain
- Reactive Probabilistic Programs and Refinement Algebra
- Probabilistic Choice in Refinement Algebra
- Modal Semirings Revisited
- Refinement Algebra with Operators for Enabledness and Termination
- Demonic Algebra with Domain
- Omega Algebra, Demonic Refinement Algebra and Commands
- On Two Dually Nondeterministic Refinement Algebras
Cited In (6)
This page was built for publication: Abstract representation theorems for demonic refinement algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604454)