A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Modal logics for communicating systems
Theoretical Computer Science
Trace, failure and testing equivalences for communicating processes
International Journal of Parallel Programming
Proceedings of the Fourth Annual Symposium on Logic in computer science
The expressive power of implicit specifications
Selected papers of the 3rd workshop on Concurrency and compositionality
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Characteristic formulae for processes with divergence
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Three logics for branching bisimulation
Journal of the ACM (JACM)
Model checking
Communication and Concurrency
Handbook of Process Algebra
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Weakest-Congruence Results for Livelock-Preserving Equivalences
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Infinite Probabilistic and Nonprobabilistic Testing
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the Conference on Logic of Programs
Model checking is refinement --- Relating Buechi testing and linear-time temporal logic ---
Model checking is refinement --- Relating Buechi testing and linear-time temporal logic ---
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Conjunction on processes: full–abstraction via ready–tree semantics
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Using fairness constraints in process-algebraic verification
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
This paper extends DeNicola and Hennessy's testing theory from labeled transition system to Büchi processes and establishes a tight connection between the resulting Büchi must-preorder and satisfaction of linear-time temporal logic (LTL) formulas. An example dealing with the design of a communications protocol testifies to the utility of the theory for heterogeneous system design, in which some components are specified as labeled transition systems and others are given as LTL formulas.