Communicating sequential processes
Communicating sequential processes
Executing temporal logic programs
Executing temporal logic programs
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
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Towards action-refinement in process algebras
Information and Computation
Characteristic formulae for processes with divergence
Information and Computation
Modal and temporal properties of processes
Modal and temporal properties of processes
Communication and Concurrency
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
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
A modal fixpoint logic with chop
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Compositionality of fixpoint logic with chop
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
It is widely agreed that the modular method is one of the most effective methods to specify and verify complex systems in order to avoid combinatorial explosion. FLC ( Fixpoint Logic with Chop) is an important modal logic because of its expressivity and logic properties, e.g., it is strictly more expressive than the @m-calculus. In this paper, we study the compositionality of FLC, namely, to investigate the connection between the connectives of the logic and the constructors of programs. To this end, we first extend FLC with a nondeterministic operator ''+'' (FLC^+ for the extension) and then establish a correspondence between the logic and the basic process algebra with deadlock and termination (abbreviated by BPA"@d^@e). Finally, we show that as a by-product of the correspondence characteristic formulae for processes of BPA"@d^@e up to strong (observational) bisimulation can be constructed compositionally directly from the syntax of processes.