On the public citation graph
Demonic Algebra with Domain
0 signed · 44 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1007/11783596_23openalex-snapshot
Refinement Algebra with Operators for Enabledness and Termination
inferredcites →https://doi.org/10.1007/11828563_15openalex-snapshot
Omega Algebra, Demonic Refinement Algebra and Commands
inferredcites →https://doi.org/10.1007/978-3-7091-6510-2openalex-snapshot
Relational Methods in Computer Science
inferredcites →https://doi.org/10.1007/978-3-7091-6510-2_11openalex-snapshot
Refinement and Demonic Semantics
inferredcites →https://doi.org/10.1016/0304-3975(86)90172-6openalex-snapshot
Relational algebraic semantics of deterministic and nondeterministic programs
inferredcites →https://doi.org/10.1016/0304-3975(94)00271-jopenalex-snapshot
Embedding a demonic semilattice in a relation algebra
inferredcites →https://doi.org/10.1016/0304-3975(95)00082-8openalex-snapshot
Relation-algebraic semantics
inferredcites →https://doi.org/10.1016/j.jlap.2005.04.006openalex-snapshot
Kleene under a modal demonic star
inferredcites →https://doi.org/10.1016/j.scico.2003.09.002openalex-snapshot
Towards a refinement algebra
inferredcites →https://doi.org/10.1016/s0020-0255(01)00165-7openalex-snapshot
Parallel composition and decomposition of specifications
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1017/s096012950000030xopenalex-snapshot
Demonic operators and monotype factors
inferredcites →https://doi.org/10.1109/sesd.1999.781109openalex-snapshot
Applying a generalization of a theorem of Mills to generalized looping structures
inferredcites →https://doi.org/10.1145/1460690.1460715openalex-snapshot
A basis for a mathematical theory of computation, preliminary report
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11828563_15openalex-snapshot
Omega Algebra, Demonic Refinement Algebra and Commands
inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_19openalex-snapshot
Modal Semirings Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_6openalex-snapshot
Latest News about Demonic Algebra with Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_7openalex-snapshot
On the Structure of Demonic Refinement Algebras with Enabledness and Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_11openalex-snapshot
General Correctness Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_11openalex-snapshot
Partial, Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_10openalex-snapshot
Unifying Recursion in Partial, Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_11openalex-snapshot
Unifying Correctness Statements
inferred← citeshttps://doi.org/10.1007/s00012-021-00718-5openalex-snapshot
Finite representability of semigroups with demonic refinement
inferred← citeshttps://doi.org/10.1007/s00012-021-00719-4openalex-snapshot
Axioms for signatures with domain and demonic composition
inferred← citeshttps://doi.org/10.1007/s00233-020-10117-2openalex-snapshot
How to generalise demonic composition
inferred← citeshttps://doi.org/10.1007/s00233-023-10380-zopenalex-snapshot
Ehresmann–Schein–Nambooripad theorems for classes of biunary semigroups
inferred← citeshttps://doi.org/10.1007/s00233-025-10595-2openalex-snapshot
The algebra of the monoid of order-preserving functions on an n-set and other reduced E-Fountain semigroups
inferred← citeshttps://doi.org/10.1007/s00236-012-0162-2openalex-snapshot
Algebras for iteration and infinite computations
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2022.04.038openalex-snapshot
Left restriction monoids from left E-completions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.08.001openalex-snapshot
Infinite executions of lazy and strict computations
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.014openalex-snapshot
Abstract representation theorems for demonic refinement algebras
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.009openalex-snapshot
Extended designs algebraically
inferred← citeshttps://doi.org/10.1093/jigpal/jzab026openalex-snapshot
The Algebra of Non-deterministic Programs: Demonic Operations, Orders and Axioms
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470509openalex-snapshot
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition
showing the first 20 of 21 · page through all 21
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.