Abstract
We introduce a new formalism to compose interacting heterogeneous systems described by extended motion description languages (mdles). The novelty lies in producing a composed system whose behavior could be a superset of the union of the behaviors of its generators. In the class of systems modeled using mdles, the composition operator is closed, and language equivalence can be decidable. Our approach consists of representing mdles as normed processes, recursively defined as a guarded system of recursion equations in restricted Greibach Normal Form over a basic process algebra. Basic processes have well defined semantics for composition, which we exploit to establish the properties of our composed mdles.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brockett, R.: Formal languages for motion description and map making. In: Bailleul, J., Brockett, R., Donald, B. (eds.) Robotics, vol. 41, pp. 181–193. ACM, New York (1990)
Manikonda, V., Krishnaprasad, P., Hendler, J.: Languages, behaviors, hybrid architectures and motion control. In: Baillieul, J., Willems, J.C. (eds.) Mathematical Control Theory, pp. 200–226. Springer, Heidelberg (1998)
Hristu, D., Krishnaprasad, P., Anderson, S., Zhang, F., D’Anna, L., Sodre, P.: The MDLe engine: A software tool for hybrid motion control. Technical Report 2000-54, Institute for Systems Research, University of Maryland (2000)
Baeten, J.: A brief history of process algebra. Technical Report CSR 04-02, Vakgroep Informatica, Technische Universiteit Eindhoven (2004)
Frazzoli, E., Dahleh, M.A., Feron, E.: Maneuver-based motion planning for nonlinear systems with symmetries. IEEE Trans. on Robotics 21, 1077–1091 (2005)
Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77, 541–580 (1989)
Jancar, P.: Undecidability of bisimilarity for petri nets and some related problems. Theoretical Computer Science 148, 281–301 (1995)
Hristu-Varsakelis, D., Egerstedt, M., Krishnaparsad, P.: On the structural complexity of the motion description language MDLe. In: Proceedings of the 42nd IEEE Conference on Descision and Control, pp. 3360–3365 (2003)
Burkart, O., Steffen, B.: Composition, decomposition and model checking of pushdown processes. Nordic Journal of Computing 158, 89–125 (1995)
Baeten, J., Bergstra, J., Klop, J.W.: Decidability of bisimulation equivalence for process generating context-free languages. Journal of the ACM 40, 653–683 (1993)
Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel process. Theoretical Computer Science 158, 143–159 (1996)
Milner, R.: A Calculus of Communicating Systems. Lecture Notes in Computer Sciences, vol. 42. Springer, Heidelberg (1980)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Hoare, C.: Communicating Sequential Processes. Lecture Notes in Computer Sciences. Prentice-Hall, Englewood Cliffs (1985)
Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1991)
Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W.: UPPAAL - a tool suite for automatic verification of real-time systems. In: DIMACS Workshop on Verification and Control of Hybrid Systems, Springer, Heidelberg (1995)
Henzinger, T., Ho, P.H., Wong-Toi, H.: A user guide to hyt ech. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41–71. Springer, Heidelberg (1995)
Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool KRONOS. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 208–219. Springer, Heidelberg (1996)
Brockett, R.W.: On the computer control of movement. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 534–540 (1988)
Hirshfeld, Y., Jerrum, M.: Bisimulation equivalence is decidable for normed process algebra. Technical Report ECS-LFCS-98-386, School of Informatics at the University of Edinburgh (1998)
Pappas, G.J.: Bisimilar linear systems. Automatica 39, 2035–2047 (2003)
Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company (1997)
Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (2001)
Hopcroft, J., Schwarz, J., Sharir., M.: On the complexity of motion planning for multiple independent objects:pspace-hardness of the ’warehouseman’s problem. International Journal of Robotics Tesearch 3, 76–88 (1984)
Robert, A., Hearn, E.D.D.: Pspace-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343, 72–96 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, W., Tanner, H.G. (2008). Composition of Motion Description Languages. In: Egerstedt, M., Mishra, B. (eds) Hybrid Systems: Computation and Control. HSCC 2008. Lecture Notes in Computer Science, vol 4981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78929-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-78929-1_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78928-4
Online ISBN: 978-3-540-78929-1
eBook Packages: Computer ScienceComputer Science (R0)