scientific article; zbMATH DE number 7204945

DOI10.4230/LIPICS.CONCUR.2017.28MaRDI QIDQ5111642zbMATH OpenFDO

Authors Paul Brunet, Damien Pous, Georg Struth

Publication date 27 May 2020

zbMATH Keywords

Petri netsconcurrent Kleene algebraseries-parallel pomsets

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 177804 (Why is no real title available?)
• scientific article; zbMATH DE number 7204945 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
• Concurrent Kleene algebra and its foundations
• Deciding true concurrency equivalences on safe, finite nets
• On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory Concurrency
• Programming Techniques: Regular expression search algorithm
• Series-parallel languages and the bounded-width property
• The Recognition of Series Parallel Digraphs
• The equational theory of pomsets
• Tightening the complexity of equivalence problems for commutative grammars
• Une condition impliquant toutes les identités rationnelles
• Une remarque sur les systèmes complets d'identités rationnelles

Cited in

(15)

• On series-parallel pomset languages: rationality, context-freeness and automata
• Deciding synchronous Kleene algebra with derivatives
• scientific article; zbMATH DE number 7559476 (Why is no real title available?)
• Concurrent Kleene algebra: free model and completeness
• scientific article; zbMATH DE number 7649949 (Why is no real title available?)
• 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 theorems for bi-Kleene algebras and series-parallel rational pomset languages
• Completeness and incompleteness of synchronous Kleene algebra
• scientific article; zbMATH DE number 7407791 (Why is no real title available?)
• scientific article; zbMATH DE number 7204945 (Why is no real title available?)
• On tools for completeness of Kleene algebra with hypotheses
• scientific article; zbMATH DE number 7649887 (Why is no real title available?)
• 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)