Image reflection on process graphs of 1-free regular expressions modulo bisimilarity
From MaRDI portal
Cites work
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- A complete inference system for a class of regular behaviours
- A complete proof system for 1-free regular expressions modulo bisimilarity
- A general completeness theorem for skip-free star algebras
- Concurrent Kleene Algebra
- scientific article; zbMATH DE number 1113856 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 7456061 (Why is no real title available?)
- Logical foundations of cyber-physical systems
- Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
- On star expressions and completeness theorems
- Probabilistic NetKAT
- Realization of Events by Logical Nets
- Two Complete Axiom Systems for the Algebra of Regular Events
This page was built for publication: Image reflection on process graphs of 1-free regular expressions modulo bisimilarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879025)