Algebraic calculi for hybrid systems

Over the past decades incorrect software has claimed numerous lives and has caused environmental damages. Furthermore incorrect software regularly yields economic losses. Systems that interact with their environment are especially fault-prone. On the one hand, they have to be exible enough to react to environment changes, on the other hand they have to be predictable. Unlike software systems for o ce work, interacting systems must satisfy restrictive safety criteria an airbag that in ates too late is unacceptable. Hybrid systems are often used to model such safety critical systems. They are heterogeneous systems characterised by the interaction of continuous dynamics and discrete events that cause state changes. They have found widespread applications ranging from control and medical engineering to avionics. But even biological and chemical processes can concisely be described by such systems. In many cases, hybrid systems are too complex for computer-aided veri cation even with today's computers that o er enormous memory and calculating capacities. In this book, we aim at a compact treatment of veri cation tasks. Algebraic techniques are of particular interest and arise in a natural way. Systems are algebraically described by systems of equations that are similar to those known from high school. Advantages that accrue by an algebraic approach are conciseness, clarity and simplicity; in particular with respect to (computer-aided) calculation rules. The developed algebraic characterisation of hybrid systems allows, for example, the veri cation of safety aspects by simple algebraic transformations. The approach further enables the use of o -the-shelf automated theorem provers. These provers can be employed to verify fundamental properties of hybrid systems. Over the last decade dozens of logic-based approaches have been applied to hybrid systems. These approaches range from classical propositional logics and modal or temporal logics that have been transferred over to hybrid systems to special logics that have been developed for them. Most of them are well-understood, but due to their di erent notions, syntax and semantics a uniform treatment is not available. Therefore we explore a compact and uniform treatment for all these logics. The uni cation is based on the same algebraic techniques as for the characterisation of hybrid systems. This allows cross-reasoning through all uni ed logics. In this book we pay special attention to the relationship between the logics involved and hybrid systems. The book presents fundamental methods for the analysis of hybrid systems and results in a coherent family of algebraic calculi for hybrid systems. The suitability and the relevance of the theory is proved by rst case studies.

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

[2]  Vaughan R. Pratt,et al.  Dynamic algebras: Examples, constructions, applications , 1991, Stud Logica.

[3]  Peter Höfner Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic , 2007, Electron. Notes Theor. Comput. Sci..

[4]  André Platzer,et al.  KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description) , 2008, IJCAR.

[5]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[6]  Alan K. Mackworth,et al.  A formal mathematical framework for modeling probabilistic hybrid systems , 2006, Annals of Mathematics and Artificial Intelligence.

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

[8]  Zhou Chaochen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .

[10]  Anders P. Ravn,et al.  An Extended Duration Calculus for Hybrid Real-Time Systems , 1992, Hybrid Systems.

[11]  Henny B. Sipma,et al.  STeP: The Stanford Temporal Prover (Educational Release) User''s Manual , 1995 .

[12]  Roger D. Maddux,et al.  Relation Algebras , 1997, Relational Methods in Computer Science.

[13]  Jennifer M. Davoren,et al.  On Hybrid Systems and the Modal µ-calculus , 1997, Hybrid Systems.

[14]  John Guckenheimer,et al.  A Dynamical Simulation Facility for Hybrid Systems , 1993, Hybrid Systems.

[15]  Zohar Manna,et al.  Models for reactivity , 1993, Acta Informatica.

[16]  Amir Pnueli,et al.  Explicit clock temporal logic , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[17]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[18]  Marco Hollenberg,et al.  Equational Axioms of Test Algebra , 1996, CSL.

[19]  Georg Struth Reasoning Automatically about Termination and Refinement , 2007 .

[20]  Georg Struth,et al.  Abstract abstract reduction , 2006, J. Log. Algebraic Methods Program..

[21]  Gunther Schmidt,et al.  Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .

[22]  Karl Henrik Johansson,et al.  Dynamical properties of hybrid automata , 2003, IEEE Trans. Autom. Control..

[23]  Zohar Manna,et al.  A Hardware Semantics Based on Temporal Intervals , 1983, ICALP.

[24]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[25]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[26]  J. Conway Regular algebra and finite machines , 1971 .

[27]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[28]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[29]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Rectangular Hybrid Systems , 2000, TACAS.

[30]  Harald Ganzinger,et al.  Ordered chaining calculi for first-order theories of transitive relations , 1998, JACM.

[31]  A. Nerode,et al.  Logics for hybrid systems , 2000, Proceedings of the IEEE.

[32]  Tamar Frankel [The theory and the practice...]. , 2001, Tijdschrift voor diergeneeskunde.

[33]  Annabelle McIver,et al.  Using probabilistic Kleene algebra pKA for protocol verification , 2008, J. Log. Algebraic Methods Program..

[34]  Dexter Kozen,et al.  KAT-ML: an interactive theorem prover for Kleene algebra with tests , 2006, J. Appl. Non Class. Logics.

[35]  Dexter Kozen A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[36]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[37]  Bruno Dutertre,et al.  Complete proof systems for first order interval temporal logic , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[38]  P. Ramadge,et al.  Modular feedback logic for discrete event systems , 1987 .

[39]  Michel Sintzoff,et al.  Iterative Synthesis of Control Guards Ensuring Invariance and Inevitability in Discrete-Decision Games , 2004, Essays in Memory of Ole-Johan Dahl.

[40]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[41]  Roland Carl Backhouse,et al.  Algebraic and Coalgebraic Methods in the Mathematics of Program Construction , 2000, Lecture Notes in Computer Science.

[42]  Hanpin Wang,et al.  Completeness of temporal logics over infinite intervals , 2004, Discret. Appl. Math..

[43]  Leslie Lamport,et al.  Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers [Book Review] , 2002, Computer.

[44]  Manfred Broy,et al.  Software Pioneers: Contributions to Software Engineering , 2002 .

[45]  Daniel Krob,et al.  Complete Systems of B-Rational Identities , 1991, Theor. Comput. Sci..

[46]  Thomas Hillenbrand,et al.  WALDMEISTER - High-Performance Equational Deduction , 1997, Journal of Automated Reasoning.

[47]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[48]  P. Nurse,et al.  A quantitative model for the cdc2 control of S phase and mitosis in fission yeast. , 1996, Trends in genetics : TIG.

[49]  Ashish Tiwari,et al.  Symbolic Systems Biology: Hybrid Modeling and Analysis of Biological Networks , 2004, HSCC.

[50]  John Lygeros,et al.  Lecture Notes on Hybrid Systems , 2004 .

[51]  Jonathan S. Ostroff,et al.  Synthesis of controllers for real-time discrete event systems , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[52]  J. M. Corbett Designing hybrid automated manufacturing systems: A European perspective , 1988 .

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

[54]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[55]  André Platzer,et al.  Differential Dynamic Logic for Hybrid Systems , 2008, Journal of Automated Reasoning.

[56]  Jules Desharnais,et al.  Static Analysis of Programs Using Omega Algebra with Tests , 2005, RelMiCS.

[57]  Peter Höfner,et al.  Automated Reasoning for Hybrid Systems - Two Case Studies - , 2008, RelMiCS.

[58]  Ralph-Johan Back,et al.  Refinement Calculus: A Systematic Introduction , 1998 .

[59]  Jens Ulrik Skakkebæk Liveness and Fairness in Duration Calculus , 1994, CONCUR.

[60]  S. Shankar Sastry,et al.  Sufficient Conditions for the Existence of Zeno Behavior , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[61]  John Lygeros,et al.  Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems , 2008, Autom..

[62]  Roland Carl Backhouse,et al.  Fixed-Point Characterisation of Winning Strategies in Impartial Games , 2003, RelMiCS.

[63]  Peter Höfner From Sequential Algebra to Kleene Algebra: Interval Modalities and Duration Calculus , 2005 .

[64]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[65]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[66]  Chaochen Zhou,et al.  Completeness of Neighbourhood Logic , 1999, STACS.

[67]  Zoltán Ésik,et al.  Equational axioms for regular sets , 1993, Mathematical Structures in Computer Science.

[68]  C. Tomlin,et al.  Symbolic reachable set computation of piecewise affine hybrid automata and its application to biological modelling: Delta-Notch protein signalling. , 2004, Systems biology.

[69]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[70]  Geoff Sutcliffe,et al.  SRASS - A Semantic Relevance Axiom Selection System , 2007, CADE.

[71]  Thomas Hillenbrand,et al.  WALDMEISTER: High Performance Equational Theorem Proving , 1996, DISCO.

[72]  Bruce H. Krogh,et al.  Computational techniques for hybrid system verification , 2003, IEEE Trans. Autom. Control..

[73]  D. B. Benson,et al.  The inverse semigroup of a sum-ordered semiring , 1985 .

[74]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

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

[76]  Jan van Leeuwen,et al.  Formal models and semantics , 1990 .

[77]  Bernhard Möller,et al.  Lazy Semiring Neighbours and Some Applications , 2006, RelMiCS.

[78]  David von Oheimb,et al.  RALL: Machine-Supported Proofs for Relation Algebra , 1997, CADE.

[79]  Dexter Kozen On Hoare logic and Kleene algebra with tests , 2000, TOCL.

[80]  Roland Meyer,et al.  Model Checking Data-Dependent Real-Time Properties of the European Train Control System , 2006, 2006 Formal Methods in Computer Aided Design.

[81]  J. A. Robinson,et al.  Handbook of Automated Reasoning (in 2 volumes) , 2001 .

[82]  John Lygeros,et al.  DNA replication in the fission yeast: robustness in the face of uncertainty , 2006, Yeast.

[83]  M. W. Shields An Introduction to Automata Theory , 1988 .

[84]  S. Shankar Sastry,et al.  Semidecidable controller synthesis for classes of linear hybrid systems , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[85]  Bernhard Möller,et al.  Kleene getting lazy , 2007, Sci. Comput. Program..

[86]  Ernie Cohen,et al.  Separation and Reduction , 2000, MPC.

[87]  Larissa Meinicke,et al.  Refinement algebra for probabilistic programs , 2008, Formal Aspects of Computing.

[88]  S. Sastry,et al.  Hybrid Control in Air Traac Management Systems , 1995 .

[89]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[90]  Ralph-Johan Back,et al.  Reasoning algebraically about loops , 1999, Acta Informatica.

[91]  Georg Struth,et al.  On Automating the Calculus of Relations , 2008, IJCAR.

[92]  Bernhard Möller Complete Tests do not Guarantee Domain , 2005 .

[93]  D. Kozen Automata on Guarded Strings and Applications , 2001 .

[94]  Eric R. Ziegel,et al.  Quality engineering handbook , 1991 .

[95]  Heiko Krumm,et al.  Compositional specification and structured verification of hybrid systems in cTLA , 1998, Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98).

[96]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

[97]  Jeanine Weekes Schroer,et al.  The Finite String Newsletter Abstracts of Current Literature Glisp User's Manual , 2022 .

[98]  Jules Desharnais,et al.  Modal Kleene algebra and applications - a survey , 2004 .

[99]  Joseph Sifakis,et al.  On the Composition of Hybrid Systems , 1998, HSCC.

[100]  Joseph S. Miller Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata , 2000, HSCC.

[101]  Leslie Lamport,et al.  Hybrid Systems in TLA+ , 1992, Hybrid Systems.

[102]  Rutger M. Dijkstra,et al.  Computation calculus bridging a formalization gap , 1998, Sci. Comput. Program..

[103]  Valentin Goranko,et al.  A Road Map of Interval Temporal Logics and Duration Calculi , 2004, J. Appl. Non Class. Logics.

[104]  P. Hofner An Algebraic Semantics for Duration Calculus , 2005 .

[105]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[106]  Georg Struth,et al.  Relational and Kleene-Algebraic Methods in Computer Science , 2003, Lecture Notes in Computer Science.

[107]  Georg Struth,et al.  Kleene algebra with domain , 2003, TOCL.

[108]  Burghard von Karger,et al.  Temporal algebra , 1998, Mathematical Structures in Computer Science.

[109]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[110]  Dimitris N. Metaxas,et al.  A hybrid dynamical systems approach to intelligent low-level navigation , 2002, Proceedings of Computer Animation 2002 (CA 2002).

[111]  Alexander Moshe Rabinovich,et al.  Expressive Completeness of Duration Calculus , 2000, Inf. Comput..

[112]  Georg Struth,et al.  Termination in Modal Kleene Algebra , 2004, IFIP TCS.

[113]  Suman Roy,et al.  Notes on Neighbourhood Logic , 1997 .

[114]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[115]  Bernhard Möller,et al.  Algebraic Neighbourhood Logic , 2008, J. Log. Algebraic Methods Program..

[116]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[117]  Zohar Manna,et al.  The Theoretical Aspects of the Optimal Fixed Point , 1976, SIAM J. Comput..

[118]  M. Egerstedt,et al.  On the regularization of Zeno hybrid automata , 1999 .

[119]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.

[120]  Jan Joris Vereijken A Process Algebra for Hybrid Systems , 1999 .

[121]  Davide Bresolin,et al.  On Decidability and Expressiveness of Propositional Interval Neighborhood Logics , 2007, LFCS.

[122]  Bernhard Möller,et al.  Calculating with pointer structures , 1997, Algorithmic Languages and Calculi.

[123]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.

[124]  Ian J. Hayes,et al.  Algebraic reasoning for probabilistic action systems and while-loops , 2008, Acta Informatica.

[125]  Arun K. Pujari,et al.  Neighbourhood Logic and Interval Algebra , 1997 .

[126]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[127]  Georg Struth,et al.  Concurrent Kleene Algebra , 2009, CONCUR.

[128]  Yde Venema,et al.  Expressiveness and Completeness of an Interval Tense Logic , 1990, Notre Dame J. Formal Log..

[129]  Bruno Dutertre,et al.  On First Order Interval Temporal Logic , 1995, LICS 1995.

[130]  Mark Reynolds,et al.  An axiomatization of full Computation Tree Logic , 2001, Journal of Symbolic Logic.

[131]  Ewa Orlowska,et al.  Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus , 2002, Stud Logica.

[132]  U. Hebisch,et al.  Semirings: Algebraic Theory and Applications in Computer Science , 1998 .

[133]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[134]  Kenneth Kunen,et al.  Completeness Results for Inequality Provers , 1985, Artif. Intell..

[135]  Rudolf Berghammer,et al.  A Relational Model for Temporal Logic , 1998, Log. J. IGPL.

[136]  Patrick J. Hayes,et al.  A Common-Sense Theory of Time , 1985, IJCAI.

[137]  Georg Struth,et al.  Calculating Church-Rosser Proofs in Kleene Algebra , 2001, RelMiCS.

[138]  Martin Fränzle,et al.  Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States , 1999, CSL.

[139]  Ben C. Moszkowski,et al.  A complete axiomatization of interval temporal logic with infinite time , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[140]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[141]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[142]  E. Nigg,et al.  Cyclin‐dependent protein kinases: Key regulators of the eukaryotic cell cycle , 1995, BioEssays : news and reviews in molecular, cellular and developmental biology.

[143]  Georg Struth,et al.  Algebras of modal operators and partial correctness , 2006, Theor. Comput. Sci..