Exploring an interface model for CKA

DOI10.1007/978-3-319-19797-5_1MaRDI QIDQ2941164zbMATH OpenOpenAlexFDO

Authors Bernhard Möller, Tony Hoare

Publication date 27 August 2015

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

Full work available at URL https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/58741

zbMATH Keywords

concurrencyconcurrent Kleene algebraformal methodstemporal logic

Mathematics Subject Classification ID

Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concurrent Kleene algebra: free model and completeness
• Concurrent Kleene algebra with tests
• Concurrent Kleene algebra with tests and branching automata
• On the relation between concurrent separation logic and concurrent Kleene algebra
• Concurrent Kleene algebra and its foundations

Cites work

• A calculus of durations
• A language of specified programs
• A relational model for temporal logic
• Characterizing determinacy in Kleene algebras
• Computation calculus bridging a formalization gap
• Concurrent Kleene algebra and its foundations
• Concurrent Kleene algebra with tests
• Developments in concurrent Kleene algebra
• Enabledness and termination in refinement algebra
• Exploring modal worlds
• Graphical models of separation logic
• scientific article; zbMATH DE number 46487 (Why is no real title available?)
• scientific article; zbMATH DE number 3562460 (Why is no real title available?)
• scientific article; zbMATH DE number 3621088 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 2163052 (Why is no real title available?)
• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Interpretability of first-order linear temporal logics in fork algebras
• Kleene algebra with domain
• On powerdomains and modality
• On the completeness of the inductive assertion method
• Quantales and Temporal Logics
• Refinement Calculus
• Separation and information hiding
• Temporal algebra
• The equational theory of pomsets
• The laws of programming unify process calculi

Cited in

(3)

• Developments in concurrent Kleene algebra
• Generating Posets Beyond N
• Non-associative Kleene Algebra and Temporal Logics

This page was built for publication: Exploring an interface model for CKA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941164)