CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113MaRDI QIDQ5311477zbMATH OpenOpenAlexFDO

Authors Luís Caires, Etienne Lozes

Publication date 23 August 2005

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

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Quantifier elimination, model completeness, and related topics (03C10) 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

• Elimination of quantifiers and undecidability in spatial logics for concurrency
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• A spatial logic for concurrency. I
• A spatial logic for concurrency. II
• Elimination of spatial connectives in static spatial logics

Cited in

(8)

• Elimination of spatial connectives in static spatial logics
• Elimination of quantifiers and undecidability in spatial logics for concurrency
• A Spatial Equational Logic for the Applied π-Calculus
• On the relationship between spatial logics and behavioral simulations
• Decidable Extensions of Hennessy-Milner Logic
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• A spatial equational logic for the applied \(\pi \)-calculus

This page was built for publication: CONCUR 2004 - Concurrency Theory

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