Domain Axioms for a Family of Near-Semirings
Authors:
- 28 July 2008
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 330-345
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Using probabilistic Kleene algebra pKA for protocol verificationThe Journal of Logic and Algebraic Programming, 2008
- A Non-probabilistic Relational Model of Probabilistic Kleene Algebras2008
- Kleene getting lazyScience of Computer Programming, 2007
- Kleene algebra with domainACM Transactions on Computational Logic, 2006
- Refinement Algebra with Operators for Enabledness and TerminationLecture Notes in Computer Science, 2006
- Towards a refinement algebraScience of Computer Programming, 2004
- The Basic Algebra of Game EquivalencesStudia Logica, 2003
- Process Algebra with Recursive Operations2001
- On Hoare logic and Kleene algebra with testsACM Transactions on Computational Logic, 2000
- Reasoning algebraically about loopsActa Informatica, 1999