A Semantic Theory for Heterogeneous System Design

This paper extends DeNicola and Hennessy's testing theory from labeled transition system to Buchi processes and establishes a tight connection between the resulting Buchi 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.

[1]  Arend Rensink,et al.  Fair testing , 1995, Inf. Comput..

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[4]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[5]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[6]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[7]  Rance Cleaveland,et al.  Infinite Probabilistic and Nonprobabilistic Testing , 1998, FSTTCS.

[8]  Martín Abadi,et al.  Composing specifications , 1989, TOPL.

[9]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[10]  Rance C Luettgen.  Model checking is refinement --- Relating Buechi testing and linear-time temporal logic --- , 2000 .

[11]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

[12]  R. P. Kurshan,et al.  Automata-theoretic verification of coordinating processes , 1994 .

[13]  Stephan Merz,et al.  Model Checking , 2000 .

[14]  Orna Kupferman,et al.  Modular Model Checking , 1997, COMPOS.

[15]  Rance Cleaveland,et al.  Divergence and Fair Testing , 1995, ICALP.

[16]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[17]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[18]  Amir Pnueli,et al.  Compositionality: The Significant Difference , 1999, Lecture Notes in Computer Science.

[19]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[20]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[21]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[22]  Antti Valmari,et al.  The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic , 1992, CONCUR.

[23]  Colin Stirling,et al.  Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..

[24]  Kim G. Larsen.  The Expressive Power of Implicit Specifications , 1993, Theor. Comput. Sci..

[25]  Antti Valmari,et al.  Weakest-Congruence Results for Livelock-Preserving Equivalences , 1999, CONCUR.

[26]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.