Tower induction and up-to techniques for CCS with fixed points

DOI10.1007/978-3-319-57418-9_17MaRDI QIDQ5283217zbMATH OpenOpenAlexFDO

Authors Steven Schäfer, Gert Smolka

Publication date 21 July 2017

Published in Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57418-9_17

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Formalization of mathematics in connection with theorem provers (68V20)

Recommendations

• Coinduction All the Way Up
• A general account of coinduction up-to
• Coinduction up-to in a fibrational setting
• Automata, Languages and Programming
• Beyond Bisimulation: The “up-to” Techniques

Cites work

• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
• Coinduction All the Way Up
• Complete Lattices and Up-To Techniques
• Monads need not be endofunctors
• On the Bourbaki-Witt principle in toposes
• On the bisimulation proof method
• The largest respectful function
• The power of parameterization in coinductive proof
• Transfinite constructions in classical type theory
• Types for Proofs and Programs
• Weak Bisimulation Up to Elaboration

Cited in

(1)

• Diacritical companions

Describes a project that uses

Uses Software

• Paco
• Coq

This page was built for publication: Tower induction and up-to techniques for CCS with fixed points

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