Modal Semirings Revisited

DOI10.1007/978-3-540-70594-9_19zbMath1157.68026MaRDI QIDQ3521996

Georg Struth, Jules Desharnais

Publication date: 28 August 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70594-9_19

Mathematics Subject Classification ID

03B70: Logic in computer science

16Y60: Semirings

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Modal Tools for Separation and Refinement, Domain Axioms for a Family of Near-Semirings, Abstract representation theorems for demonic refinement algebras, Algebraic notions of nontermination: Omega and divergence in idempotent semirings, Axiomatizability of representable domain algebras, Internal axioms for domain semirings, Automated verification of refinement laws, The Structure of the One-Generated Free Domain Semiring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kleene modules and linear languages
• Algebras of modal operators and partial correctness
• A completeness theorem for Kleene algebras and the algebra of regular events
• Towards a refinement algebra
• Automated theorem proving by resolution in non-classical logics
• Automated Reasoning in Kleene Algebra
• Refinement Algebra with Operators for Enabledness and Termination
• Kleene algebra with domain
• Computer Science Logic
• Demonic Algebra with Domain
• Using Probabilistic Kleene Algebra for Protocol Verification
• Domain Axioms for a Family of Near-Semirings
• Boolean Algebras with Operators. Part I
• Theory Is Forever