Pages that link to "Item:Q578896"

The following pages link to Modal logics for communicating systems (Q578896):

Displaying 36 items.

• Refusal testing (Q580961) (← links)
• Games for the \(\mu\)-calculus (Q671352) (← links)
• Graphical versus logical specifications (Q685358) (← links)
• Observing localities (Q685414) (← links)
• Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
• Bisimulation and divergence (Q750163) (← links)
• Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
• Duality for modal \(\mu\)-logics (Q1128984) (← links)
• Domain theory in logical form (Q1174593) (← links)
• Correctness of concurrent processes (Q1176236) (← links)
• Local model checking in the modal mu-calculus (Q1177939) (← links)
• Local model checking for infinite state spaces (Q1190489) (← links)
• Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
• A complete modal proof system for HAL: the Herbrand agent language (Q1311969) (← links)
• Extension of synthesis algorithm of recursive processes to \(\mu\)-calculus (Q1350215) (← links)
• Mathematical modal logic: A view of its evolution (Q1422628) (← links)
• Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
• Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
• A modal logic for message passing processes (Q1894680) (← links)
• Honesty in partial logic (Q1919981) (← links)
• Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
• A general method for proving decidability of intuitionistic modal logics (Q2506825) (← links)
• A domain equation for bisimulation (Q2639646) (← links)
• Intuitionistic Layered Graph Logic (Q2817944) (← links)
• A Logical Process Calculus (Q2842601) (← links)
• Characteristic formulae for fixed-point semantics: a general framework (Q2883115) (← links)
• Extending modal transition systems with structured labels (Q2909731) (← links)
• Reasoning about higher-order processes (Q5096732) (← links)
• Generating diagnostic information for behavioral preorders (Q5137006) (← links)
• Synthesis of Data Views for Communicating Processes (Q5504601) (← links)
• Termination, deadlock and divergence (Q5887521) (← links)
• A fully abstract denotational model for observational precongruence (Q5940916) (← links)
• A fully abstract denotational semantics for the calculus of higher-order communicating systems (Q5940933) (← links)
• Models and logics for true concurrency. (Q5955751) (← links)
• A fully abstract denotational model for observational precongruence (Q6560177) (← links)
• Modal and temporal logics for processes (Q6560391) (← links)