Synchronous Kleene algebra
From MaRDI portal
Publication:710676
DOI10.1016/J.JLAP.2010.07.009zbMATH Open1204.68123OpenAlexW2114258290WikidataQ114851550 ScholiaQ114851550MaRDI QIDQ710676FDOQ710676
Authors: Cristian Prisacariu 
Publication date: 22 October 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.009
Recommendations
synchronyautomata theorycompletenessHoare logicuniversal algebraKleene algebraconcurrency modelsBoolean testsSCCS calculus
Cites Work
- KAT-ML: an interactive theorem prover for Kleene algebra with tests
- The Esterel synchronous programming language: Design, semantics, implementation
- Higher-level synchronising devices in Meije-SCCS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculi for synchrony and asynchrony
- Modeling concurrency with partial orders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Complete Axiom Systems for the Algebra of Regular Events
- An axiomatic proof technique for parallel programs
- A completeness theorem for Kleene algebras and the algebra of regular events
- Title not available (Why is that?)
- Concurrent Kleene Algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Hoare logic and Kleene algebra with tests
- Free shuffle algebras in language varieties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local variable scoping and Kleene algebra with tests
- $\mathcal{CL}$ : An Action-Based Logic for Reasoning about Contracts
- Title not available (Why is that?)
- A deontic logic of action
- Regular expressions and the equivalence of programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relational Semantics for Higher-Order Programs
Cited In (15)
- A semantics and a logic for \textit{Fuzzy Arden Syntax}
- Introducing synchrony in fuzzy automata
- On series-parallel pomset languages: rationality, context-freeness and automata
- Title not available (Why is that?)
- Deciding synchronous Kleene algebra with derivatives
- Brzozowski goes concurrent -- a Kleene theorem for pomset languages
- A synchronous effects logic for temporal verification of pure Esterel
- Concurrent Kleene algebra with tests and branching automata
- Kleene Theorems for Synchronous Products with Matching
- A dynamic deontic logic for complex contracts
- Concurrent Kleene algebra and its foundations
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
- Weighted synchronous automata
- Completeness and incompleteness of synchronous Kleene algebra
- Concurrent Kleene Algebra
Uses Software
This page was built for publication: Synchronous Kleene algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710676)
