From Timed Automata to Logic - and Back

In this paper, we define a timed logic L v which is sufficiently expressive that we for any timed automaton may construct a single characteristic L v formula uniquely characterizing the automaton up to timed bisimilarity.

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

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

[3]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

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

[5]  Kim G. Larsen,et al.  Synthesizing Distinguishing Formulae for Real Time Systems , 1994, Nord. J. Comput..

[6]  Faron Moller,et al.  Relating Processes With Respect to Speed , 1991, CONCUR.

[7]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[8]  Anna Gál,et al.  Lower bounds for monotone span programs , 1994, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[9]  Kim Guldstrand Larsen,et al.  From Timed Automata to Logic - and Back , 1995 .

[10]  Joseph Sifakis,et al.  A Modal Characterization of Observational Congruence on Finite Terms of CCS , 1986, Inf. Control..

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

[12]  Paul Crubillé,et al.  A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems , 1988, Inf. Process. Lett..

[13]  Pierre Wolper,et al.  The tableau method for temporal logic: an overview , 1985 .

[14]  Peter Bro Miltersen,et al.  Dynamic Algorithms for the Dyck Languages , 1995, WADS.

[15]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[16]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

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

[18]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[19]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[20]  R. Alur.  Techniques for automatic verification of real-time systems , 1991 .

[21]  Rohit Parikh,et al.  A Decision Procedure for the Propositional µ-Calculus , 1983, Logic of Programs.

[22]  Rance Cleaveland,et al.  Computing Behavioural Relations, Logically , 1991, ICALP.

[23]  Henrik Reif Andersen.  Model Checking and Boolean Graphs , 1992, ESOP.

[24]  Peter Bro Miltersen,et al.  Dynamic Algorithms for the Dyck Languages , 1995 .

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

[26]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[27]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[28]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[29]  G. E. Hughes,et al.  An introduction to modal logic, 2e éd., 1 vol , 1973 .

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

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

[32]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

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

[34]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

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

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