Rewriting logic and probabilities

DOI10.1007/3-540-44881-0_6MaRDI QIDQ4447223zbMATH OpenFDO

Authors Mathieu Hoyrup, Olivier Bournez

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2706/27060061.htm

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Theoretical Aspects of Computing – ICTAC 2005
• scientific article; zbMATH DE number 2090711
• Twenty years of rewriting logic
• Rewriting logic as a semantic framework for concurrency: a progress report
• Conditional rewriting logic: Deduction, models and concurrency

Cited in

(12)

• On the hardness of analyzing probabilistic programs
• Twenty years of rewriting logic
• Confluence in probabilistic rewriting
• scientific article; zbMATH DE number 6712184 (Why is no real title available?)
• Probabilistic Choice, Reversibility, Loops, and Miracles
• Probabilistic real-time rewrite theories and their expressive power
• Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
• Strategic port graph rewriting: an interactive modelling framework
• scientific article; zbMATH DE number 2090711 (Why is no real title available?)
• The vectorial \(\lambda\)-calculus
• A rewriting based model for probabilistic distributed object systems.
• A distribution semantics for probabilistic term rewriting

This page was built for publication: Rewriting logic and probabilities

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