Formal Techniques for Networked and Distributed Systems - FORTE 2005

DOI10.1007/11562436MaRDI QIDQ5479166zbMATH OpenOpenAlexFDO

Authors Naijun Zhan, Mila Majster-Cederbaum

Publication date 7 July 2006

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

Full work available at URL https://doi.org/10.1007/11562436

zbMATH Keywords

nondeterminismprocess algebra\(\mu\)-calculussynchronization tree logic

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A logic for the description of non-deterministic programs and their properties
• Fixed-point Logics with Nondeterministic Choice
• scientific article; zbMATH DE number 1303442
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus

Cited in

(1)

• Towards separating nondeterminism from determinism

This page was built for publication: Formal Techniques for Networked and Distributed Systems - FORTE 2005

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