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
Three partition refinement algorithms
SIAM Journal on Computing
Observation equivalence as a testing equivalence
Theoretical Computer Science
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
Modal and temporal properties of processes
Modal and temporal properties of processes
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Handbook of Process Algebra
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
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Complete Proof Systems for First Order Interval Temporal Logic
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
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Connecting Algebraic and Logical Descriptions of Concurrent Systems
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
A domain equation for bisimulation
Information and Computation
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
Deriving non-determinism from conjunction and disjunction
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Hi-index | 0.00 |
The logical and algebraic approaches are regarded as two of the dominant methodologies for the development of reactive and concurrent systems. It is well known that the logic approach is more abstract, but lacks compositionality; while the algebraic approach is inherently compositional, but lacks abstractness. However, connecting the two approaches is a major challenge in computer science, and many efforts have been directed to resolving the problem. Linking the algebraic approach to the logical approach has been satisfactorily resolved through the notion of characteristic formulae. But very limited success has been achieved so far in the other direction, as most of the established results have been developed only with respect to a simple semantics, which has usually been strong bisimulation. However, in practice, an observational semantics like weak bisimulation, which is much more complicated, is thought to be more useful. In this paper, we investigate how to connect the logical and algebraic approaches with respect to the observational preorder, which is a generalisation of weak bisimulation that takes divergence into account. We show the following results. First, we prove that the non-deterministic operator of process algebra can be defined in modal and temporal logics (such as the μ-calculus and the Fixpoint Logic with Chop) with respect to the observational preorder (in fact, the kernel of its precongruence). In this way, we can apply the logical approach to the design of a complex system in a compositional way. Second, we present two algorithms for constructing the characteristic formulae for a context-free process up to the preorder and its precongruence, respectively. The effect of this is that all the reductions for processes that are usually done in an algebraic setting can be handled in a logical setting.