Decidability of modular logics for concurrency

DOI10.1007/978-3-642-29709-0_24MaRDI QIDQ3457984zbMATH OpenOpenAlexFDO

Authors Radu Mardare

Publication date 7 December 2015

Published in Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29709-0_24

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Modular Algorithms for Heterogeneous Modal Logics
• CONCUR 2004 - Concurrency Theory
• Decidability of model checking for infinite-state concurrent systems
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• Modular construction of complete coalgebraic logics

Cited in

(7)

• On pushout consistency, modularity and interpolation for logical specifications
• On the concurrent computational content of intermediate logics
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• Modular Markovian Logic
• scientific article; zbMATH DE number 1418374 (Why is no real title available?)
• Modular Algorithms for Heterogeneous Modal Logics
• On decidability and model checking for a first order modal logic for value-passing process

This page was built for publication: Decidability of modular logics for concurrency

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