scientific article; zbMATH DE number 7204945
From MaRDI portal
Publication:5111642
DOI10.4230/LIPICS.CONCUR.2017.28zbMATH Open1442.68128MaRDI QIDQ5111642FDOQ5111642
Paul Brunet, Georg Struth, Damien Pous
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- Concurrent Kleene algebra and its foundations
- Concurrent Kleene Algebra
- Foundations of concurrent Kleene algebra
- Developments in concurrent Kleene algebra
- Developments in concurrent Kleene algebra
- On the relation between concurrent separation logic and concurrent Kleene algebra
- Probabilistic concurrent Kleene algebra
- Concurrent Kleene algebra: free model and completeness
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Concurrent Kleene algebra with tests and branching automata
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- The Recognition of Series Parallel Digraphs
- The equational theory of pomsets
- Series-parallel languages and the bounded-width property
- Une remarque sur les systèmes complets d'identités rationnelles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Une condition impliquant toutes les identités rationnelles
- Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
- Concurrent Kleene algebra and its foundations
- Programming Techniques: Regular expression search algorithm
- Deciding true concurrency equivalences on safe, finite nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory Concurrency
Cited In (13)
- On series-parallel pomset languages: rationality, context-freeness and automata
- Title not available (Why is that?)
- Concurrent Kleene algebra: free model and completeness
- Title not available (Why is that?)
- Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
- On tools for completeness of Kleene algebra with hypotheses
- On the complexity of reasoning in Kleene algebra
- Completeness and incompleteness of synchronous Kleene algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- On tools for completeness of Kleene algebra with hypotheses
- Title not available (Why is that?)
- Concurrent Kleene Algebra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111642)
