Synthesizing Distinguishing Formulae for Real Time Systems

This paper describes a technique for generating diagnostic information for the timed bisimulation equivalence and the timed simulation preorder. More precisely, given two (parallel) networks of regular real-time processes, the technique will provide a logical formula that differentiates them in case they are not timed (bi)similar. Our method may be seen as an extension of the algorithm by Cerans for deciding timed bisimilarity in that information of time-quantities has been added sufficient for generating distinguishing formulae.

[1]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

[2]  Kim G. Larsen,et al.  Real-Time Calculi and Expansion Theorems , 1992, NAPAW.

[3]  R. V. Glabbeek.  The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[4]  Arne Skou,et al.  Automatic Verification of Real-Timed Systems Using EPSILON , 1994 .

[5]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[6]  Sten Agerholm,et al.  A HOL Basis for Reasoning about Functional Programs , 1994 .

[7]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

[8]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[9]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[10]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[11]  Ivan Damgård,et al.  Enhancing the Strength of Conventional Cryptosystems , 1994 .

[12]  Kim G. Larsen,et al.  Automatic Synthesis of Real Time Systems , 1994, ICALP.

[13]  Kim G. Larsen,et al.  Synthesizing Distinguishing Formulae for Real Time Systems (Extended Abstract) , 1995, MFCS.

[14]  Dany Breslauer,et al.  Efficient String Matching on Coded Texts , 1994, CPM.

[15]  Kim G. Larsen,et al.  Timed Modal Specification - Theory and Tools , 1993, CAV.

[16]  Rance Cleaveland,et al.  Generating Diagnostic Information for Behavioral Preorders , 1992, CAV.

[17]  Kim Guldstrand Larsen,et al.  Timed Modal Specification —Theory and Tools , 1997 .

[18]  L. Aceto.  CPO Models for GSOS Languages - Part I: Compact GSOS Languages , 1994 .

[19]  Joseph Sifakis,et al.  Compiling Real-Time Specifications into Extended Automata , 1992, IEEE Trans. Software Eng..

[20]  Jan A. Bergstra,et al.  Algebra of Communicating Processes , 1995, Workshops in Computing.

[21]  Kim G. Larsen,et al.  A Constraint Oriented Proof Methodology Based on Modal Transition Systems , 1994, TACAS.

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

[23]  Rance Cleaveland,et al.  On Automatically Distinguishing Inequivalent Processes , 1990, CAV.

[24]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[25]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[26]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[27]  Henri Korver,et al.  Computing Distinguishing Formulas for Branching Bisimulation , 1991, CAV.

[28]  Wang Yi,et al.  Time-abstracted Bisimulation: Implicit Specifications and Decidability , 1997, Inf. Comput..

[29]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

[30]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[31]  Luca Aceto,et al.  A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version) , 1994 .

[32]  Ivan Damgård,et al.  Hashing Functions can Simplify Zero-Knowledge Protocol Design (too) , 1994 .

[33]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[34]  Peter Bro Miltersen,et al.  On data structures and asymmetric communication complexity , 1994, STOC '95.

[35]  Rocco De Nicola,et al.  Three Logics for Branching Bisimulation (Extended Abstract) , 1990, LICS 1990.

[36]  Wang Yi,et al.  Time Abstracted Bisimiulation: Implicit Specifications and Decidability , 1993, MFPS.

[37]  Kim G. Larsen,et al.  Efficient Local Correctness Checking , 1992, CAV.

[38]  Yi Wang.  A calculus of real time systems , 1991 .

[39]  Liang Chen,et al.  An Interleaving Model for Real-Time Systems , 1992, LFCS.

[40]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[41]  Joseph Sifakis,et al.  ATP: an Algebra for Timed Processes , 1990, Programming Concepts and Methods.