Intersection of Regular Signal-Event (Timed) Languages
暂无分享,去创建一个
[1] P. J. L. Cuijpers,et al. Beyond Zeno-behaviour , 2001 .
[2] Patricia Bouyer,et al. Forward Analysis of Updatable Timed Automata , 2004, Formal Methods Syst. Des..
[3] Paul Gastin,et al. Refinements and Abstractions of Signal-Event (Timed) Languages , 2006, FORMATS.
[4] Paul Caspi,et al. Timed regular expressions , 2002, JACM.
[5] Paul Caspi,et al. A Kleene theorem for timed automata , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[6] Catalin Dima,et al. Real-Time Automata and the Kleene Algebra of Sets of Real Numbers , 2000, STACS.
[7] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[8] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[9] Michael R. Hansen,et al. Finite Divergence , 1995, Theor. Comput. Sci..
[10] Paul Gastin,et al. Characterization of the Expressive Power of Silent Transitions in Timed Automata , 1998, Fundam. Informaticae.
[11] Jérôme Olivier Durand-Lose. A Kleene theorem for splitable signals , 2004, Inf. Process. Lett..
[12] Paul Gastin,et al. Timed substitutions for regular signal-event languages , 2007, Formal Methods Syst. Des..