Time-deterministic hybrid transition systems
1999 (English)In: Hybrid Systems V / [ed] Panos Antsaklis, Michael Lemmon, Wolf Kohn, Anil Nerode and Shankar Sastry, Berlin: Springer Berlin/Heidelberg, 1999, Vol. 1567, 238-250 p.Chapter in book (Refereed)
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode - an algebraic or differential equation for each state variable in terms of inputs and other state variables. Each discrete transition may be taken according to a (non-deterministic) time constraint. In this paper we restrict this model to time-deterministic discrete transitions. Thus, every transition is guarded by a condition g and has a fixed delay t. Different transitions may have different delays (including zero), but progress is enforced after the delay. Using this restriction and a composition operator which uses union of mode sets we then prove certain compositionality properties. In particular, that the parallel composition of two subsystems produces a system whose semantics is defined in terms of semantics of its constituents provided that it has a run. The restriction is well-justified in a large class of control applications where the complex mode-changing software is realised as a synchronous program.
Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 1999. Vol. 1567, 238-250 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 1567
Digital systems, Continous systems, Interacting networks.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-49506DOI: 10.1007/3-540-49163-5_13ISBN: 3-540-65643-XISBN: 978-3-540-65643-2ISBN: e-978-3-540-49163-7OAI: oai:DiVA.org:liu-49506DiVA: diva2:270402