Communicating sequential processes
Communicating sequential processes
A modal characterization of observational congruence on finite terms of CCS
Information and Control
A logic for the description of nondeterministic programs and their properties
Information and Control
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Characteristic formulae for processes with divergence
Information and Computation
Communication and Concurrency
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Foundations for Circular Compositional Reasoning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Local Model Checking Games for Fixed Point Logic with Chop
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Model Checking Fixed Point Logic with Chop
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Complete Proof Systems for First Order Interval Temporal Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Equations between regular terms and an application to process logic
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Process logic: Expressiveness, decidability, completeness
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
A modal fixpoint logic with chop
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On hierarchically developing reactive systems
Information and Computation
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
Compositionality plays an important role in designing reactive systems as it allows one to compose/decompose a complex system from/to several simpler components. Generally speaking, it is hard to design a complex system in a logical frame in a compositional way because it is difficult to find a connection between the structure of a system to be developed and that of its specification given by the logic. In this paper, we investigate the compositionality of the Fixpoint Logic with Chop (FLC for short). To this end, we extend FLC with the nondeterministic choice “+” (FLC+ for the extension) and then establish a correspondence between the logic and the basic process algebra with deadlock and termination (abbreviated BPA$^{\epsilon}_{\delta}$). Subsequently, we show that the choice “+” is definable in FLC. As an application of the compositionality of FLC, an algorithm is given to construct characteristic formulae of BPA$^{\epsilon}_{\delta}$ up to strong bisimulation directly from the syntax of processes in a compositional manner.