Part of the Lecture Notes in Computer Science book series (LNCS, volume 1046)
Compositional specification of timed systems
KeywordsComposition Operator Parallel Composition Composition Rule Input Place Deadline Constraint
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 2.T. Bolognesi and F. Lucidi. Timed process algebras with urgent interactions and a unique powerful binary operator. In Proc. REX Workshop “Real-Time: Theory in Practice”. Lecture Notes in Computer Science 600, Springer-Verlag, 1991.Google Scholar
- 5.O. Maler and A. Pnueli. Timing analysis of asynchronous circuits using timed automata. In CHARME'95. pages 189–205. Lecture Notes in Computer Science 987. Springer-Verlag, 1995.Google Scholar
- 6.P. Merlin and D. J. Farber. Recoverability of communication protocols. IEEE Transactions on Communications. 24(9). September 1976.Google Scholar
- 8.X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Proc. 3rd Workshop on Computer-Aided Verification, pages 376–398. Lecture Notes in Computer Science 575, Springer-Verlag.Google Scholar
- 9.X. Nicollin. J. Sifakis. and S. Yovine. Compiling real-time specifications into extended automata. IEEE TSE Special Issue on Real-Time Systems. 18(9):794–804. September 1992.Google Scholar
- 10.P. Sénac. M. Diaz. and P. de Saqui-Sannes. Toward a formal specification of multimedia scenarios. Annals of telecommunications. 49(5–6):297–314. 1994.Google Scholar
- 11.J. Sifakis. Use of petri nets for performance evaluation. In Measuring, modeling and evaluating computer systems, pages 75–93. North-Holland. 1977.Google Scholar
© Springer-Verlag Berlin Heidelberg 1996