Failures: Their Definition, Modelling and Analysis

This paper introduces the concept of a 'structured occurrence net', which as its name indicates is based on that of an 'occurrence net', a well-established formalism for an abstract record that represents causality and concurrency information concerning a single execution of a system. Structured occurrence nets consist of multiple occurrence nets, associated together by means of various types of relationship, and are intended for recording either the actual behaviour of complex systems as they interact and evolve, or evidence that is being gathered and analyzed concerning their alleged past behaviour. We provide a formal basis for the new formalism and show how it can be used to gain better understanding of complex fault-error-failure chains (i) among coexisting interacting systems, (ii) between systems and their sub-systems, and (iii) involving systems that are controlling, supporting, creating or modifying other systems. We then go on to discuss how, perhaps using extended versions of existing tools, structured occurrence nets could form a basis for improved techniques of system failure prevention and analysis.

[1]  B. Randell,et al.  STATE RESTORATION IN DISTRIBUTED SYSTEMS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[2]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[3]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[4]  Sjouke Mauw,et al.  The Formalization of Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[5]  Maciej Koutny,et al.  Applying Petri Net Unfoldings for Verification of Mobile Systems , 2006 .

[6]  Alexandre Yakovlev,et al.  Online testing by protocol decomposition , 2006, 12th IEEE International On-Line Testing Symposium (IOLTS'06).

[7]  Maciej Koutny,et al.  Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT , 2006, Fundam. Informaticae.

[8]  Maciej Koutny,et al.  Process semantics of general inhibitor nets , 2004, Inf. Comput..

[9]  Joost Engelfriet,et al.  Elementary Net Systems , 1996, Applications and Theory of Petri Nets.

[10]  Maciej Koutny,et al.  Towards a Petri Net Semantics for Membrane Systems , 2005, Workshop on Membrane Computing.

[11]  F. Javier Thayer Fábrega,et al.  Strand spaces: proving security protocols correct , 1999 .

[12]  Carl E. Landwehr,et al.  Basic concepts and taxonomy of dependable and secure computing , 2004, IEEE Transactions on Dependable and Secure Computing.

[13]  William H. Sanders,et al.  The Mobius modeling tool , 2001, Proceedings 9th International Workshop on Petri Nets and Performance Models.

[14]  Thomas Chatain,et al.  Symbolic Diagnosis of Partially Observable Concurrent Systems , 2004, FORTE.

[15]  Maciej Koutny,et al.  Verification of bounded Petri nets using integer programming , 2007, Formal Methods Syst. Des..

[16]  Brian Randell,et al.  A formal model of atomicity in asynchronous systems , 1981, Acta Informatica.

[17]  Stefan Lenk.  Extended timing diagrams as a specification language , 1994, EURO-DAC '94.