Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
type: Item
instance of: scholarly article
title: Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
zbMATH Open document ID: 1072.68070
published in: The Journal of Logic and Algebraic Programming
publication date: 2004-09-08T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03F03
zbMATH DE Number: 2099289
author: Alex Simpson
describes a project that uses: SLMC
MaRDI profile type: Publication
full work available at URL: j.jlap.2004.03.004
OpenAlex ID: W2135333778
cites work: Turning SOS rules into equations
cites work: Q4738309
cites work: Bisimulation can't be traced
cites work: Q4484489
cites work: Proving properties of dynamic process networks
cites work: Q4440827
cites work: -Calculus with Explicit Points and Approximations
cites work: Decidability of model checking for infinite-state concurrent systems
cites work: A modal characterization of observational congruence on finite terms of CCS
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q3992568
cites work: Q4738238
cites work: On global induction mechanisms in aμ-calculus with explicit approximations
cites work: Modal logics for communicating systems
cites work: Local model checking in the modal mu-calculus
cites work: Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
cites work: Q3776603
DOI: 10.1016/J.JLAP.2004.03.004
Recommended article: Formalizing process algebraic verifications in the calculus of constructions
Recommended article: A formal framework for specifying sequent calculus proof systems
Recommended article: Generic Methods for Formalising Sequent Calculi Applied to Provability Logic
Recommended article: Logic for Programming, Artificial Intelligence, and Reasoning
Recommended article: On the expressiveness and decidability of higher-order process calculi
Recommended article: A compositional \(\mu\)-calculus proof system for statecharts processes
Recommended article: A refinement calculus for specifications in Hennessy-Milner logic with recursion
Recommended article: A verified proof checker for higher-order logic
Recommended article: Q4312490
description: scientific article; zbMATH DE number 2099289