Modal and temporal logics for processes

DOI10.1007/3-540-60915-6_5zbMATH Open1543.68251MaRDI QIDQ6560391

Colin Stirling

Publication date: 21 June 2024

Mathematics Subject Classification ID

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) Temporal logic (03B44)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modal logics for communicating systems
• Transition system specifications with negative premises
• Bisimulation and divergence
• Algèbre de processus et synchronisation
• Results on the propositional \(\mu\)-calculus
• Automated analysis of mutual exclusion algorithms using CCS
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• CCS expressions, finite state processes, and three problems of equivalence
• Calculi for synchrony and asynchrony
• Higher-level synchronising devices in Meije-SCCS
• An automata theoretic decision procedure for the propositional mu- calculus
• Characterizing finite Kripke structures in propositional temporal logic
• A calculus of communicating systems
• Local model checking in the modal mu-calculus
• The complexity of stochastic games
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Local model checking for infinite state spaces
• A calculus of mobile processes. II
• A subexponential randomized algorithm for the simple stochastic game problem
• Temporal logic can be more expressive
• Specifying Concurrent Program Modules
• Can message buffers be axiomatized in linear temporal logic?
• Algebraic laws for nondeterminism and concurrency
• Process Algebra

Related Items (1)

Processes, systems \& tests: defining contextual equivalences

This page was built for publication: Modal and temporal logics for processes

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