Interoperability of constrained finite state automata

Finite State Automata have been extended in a number of ways with varied additional constraints with an objective of modeling varied real life problems. The current paper commonly refers to such extensions as constrained automata. It aims at defining a generic mathematical model for the constrained automata targeted towards interoperability and possible integration amongst them. The paper proposes and demonstrates usage of hyper complex symbols that realizes the objective.

[1]  M. Gordon.  HOL: A Proof Generating System for Higher-Order Logic , 1988 .

[2]  Mark Utting.  The Role of Model-Based Testing , 2005, VSTTE.

[3]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Miaomiao Zhang,et al.  On Verification of Probabilistic Timed Automata against Probabilistic Duration Properties , 2007, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007).

[5]  Natarajan Shankar,et al.  Verification of Real-Time Systems Using PVS , 1993, CAV.

[6]  Lawrence C. Paulson,et al.  Isabelle: The Next 700 Theorem Provers , 2000, ArXiv.

[7]  Farn Wang,et al.  Efficient verification of timed automata with BDD-like data structures , 2004, International Journal on Software Tools for Technology Transfer.

[8]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

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

[10]  Alan C. Shaw,et al.  Communicating Real-Time State Machines , 1992, IEEE Trans. Software Eng..

[11]  A. Prasad Sistla,et al.  Quantitative temporal reasoning , 1990, Real-Time Systems.

[12]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[13]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[14]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

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

[16]  Yassine Lakhnech,et al.  Hierarchical Automata as Model for Statecharts , 1997, ASIAN.

[17]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[18]  Pao-Ann Hsiung,et al.  User-Friendly Verification , 1999, FORTE.

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

[20]  Dirk Beyer,et al.  Efficient Verification of Timed Automata using BDDs , 2001 .

[21]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[22]  A. Fleischmann.  Distributed Systems , 1994, Springer Berlin Heidelberg.

[23]  Alexandre Petrenko,et al.  Confirming configurations in EFSM testing , 2004, IEEE Transactions on Software Engineering.

[24]  Nancy A. Lynch,et al.  Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[25]  Alexander Pretschner,et al.  Abstractions for Model-Based Testing , 2005, Electron. Notes Theor. Comput. Sci..

[26]  Pao-Ann Hsiung,et al.  Efficient and User-Friendly Verification , 2002, IEEE Trans. Computers.

[27]  Farn Wang,et al.  Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram , 2001, FORTE.

[28]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[29]  Pratibha Mishra,et al.  Advanced Engineering Mathematics , 2013 .

[30]  F. Catoni,et al.  N-dimensional geometries generated by hypercomplex numbers , 2005 .

[31]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[32]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[33]  Farn Wang,et al.  Distributed real-time system specification and verification in APTL , 1993, TSEM.

[34]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[35]  Howard Falk,et al.  Formal Verification of Timed Systems: A Survey and Perspective , 2004, Proc. IEEE.

[36]  Mark Utting,et al.  Position Paper : Model-Based Testing , 2005 .

[37]  Thomas A. Henzinger,et al.  Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[38]  Stavros Tripakis,et al.  The Tool KRONOS , 1996, Hybrid Systems.

[39]  Patricia Bouyer,et al.  Model Checking Timed Automata , 2010 .

[40]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[41]  Pao-Ann Hsiung,et al.  Automatic verification on the large , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[42]  Farn Wang,et al.  Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems , 2000, TACAS.

[43]  Nancy A. Lynch,et al.  The Theory of Timed I/o Automata , 2003 .

[44]  Navendu Jain,et al.  Verification of Timed Automata via Satisfiability Checking , 2002, FTRTFT.