Compositionality of Hennessy-Milner logic by structural operational semantics

Authors:
Wan Fokkink;Rob van Glabbeek;Paulien de Wind
Affiliations:
CWI, Department of Software Engineering, GB Amsterdam, The Netherlands and Vrije Universiteit Amsterdam, Department of Theoretical Computer Science, De Boelelaan, HV Amsterdam, The Netherlands;CWI, Department of Software Engineering, GB Amsterdam, The Netherlands and National ICT Australia, University of New South Wales, Sydney, Australia and University of New South Wales, School of Com ...;Vrije Universiteit Amsterdam, Department of Theoretical Computer Science, De Boelelaan, HV Amsterdam, The Netherlands
Venue:
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Year:
2006

Citing 19
Cited 7

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
The power of the future perfect in program logics

Information and Control
Modal logics for communicating systems

Theoretical Computer Science
On the compositional checking of validity (extended abstract)

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
Compositional checking of satisfaction

Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Bisimulation can't be traced

Journal of the ACM (JACM)
Ntyft/ntyxt rules reduce to ntree rules

Information and Computation
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
A Calculus of Communicating Systems

A Calculus of Communicating Systems
A Complete Compositional Model Proof System for a Subset of CCS

Proceedings of the 12th Colloquium on Automata, Languages and Programming
A Complete Modal Proof System for a Subset of SCCS

CAAP '85 Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Volume 1: Colloquium on Trees in Algebra and Programming: Mathematical Foundations of Software Development
Compositional Model Checking of Real Time Systems

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Modal Characterisation of Observable Machine-Behaviour

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Partial Model Checking

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Now you may compose temporal logic specifications

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Precongruence formats for decorated trace semantics

ACM Transactions on Computational Logic (TOCL)

SOS formats and meta-theory: 20 years after

Theoretical Computer Science
On the expressibility of priority

Information Processing Letters
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity

Information and Computation
Decompositional reasoning about the history of parallel processes

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for the decomposition of HML formulas. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms satisfy certain formulas, obtained by decomposing the original formula. The method uses the structural operational semantics of the process algebra. The main contribution of this paper is the extension of an earlier decomposition method for the De Simone format from the Ph.D. thesis of Larsen in 1986, to more general formats.