Modular analysis of discrete controllers for distributed hybrid systems

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 15, Issue 1, 2002, Pages 469-474

  Frehse, Goran ^a   Stursberg, Olaf ^a   Engell, Sebastian ^a   Huuck, Ralf ^b   Lukoschus, Ben ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Abstraction; Assumption Commitment; Discrete controllers; Model checking; Verification

Indexed keywords

AUTOMATION; CONTROL SYSTEM ANALYSIS; CONTROLLERS; HYBRID SYSTEMS; PARALLEL PROCESSING SYSTEMS; VERIFICATION;

ABSTRACTION; ALGORITHMIC ANALYSIS; ASSUMPTION/COMMITMENT; DISCRETE CONTROLLERS; ENTIRE SYSTEM; LINEAR HYBRID AUTOMATA; MODULAR ANALYSIS;

MODEL CHECKING;

EID: 84945534896     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20020721-6-es-1901.00566     Document Type: Conference Paper

References (17)

1. Abadi, M. and L. Lamport (1995). Conjoining specifications. ACM Trans. Progr. Lang. and Syst. 17(3), 507-534.
2. Alur, R. and T.A. Henzinger (1997). Modularity for timed and hybrid systems. In: Proc. of the 8th Int. Conf. on Concurrency Theory. Vol. 1243 of LNCS. Springer. pp. 74-88.
3. Alur, R., C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis and S. Yovine (1995). The algorithmic analysis of hybrid systems. Theoretical Comp. Science 138(1), 3-34.
4. th IEEE Syrap. Logic in Computer Science. pp. 458-465.
5. Clarke, E.M. and E.A. Emerson (1982). Design and synthesis of synchronization skeletons for branching time temporal logic. In: Logics of Programs Workshop (Dexter Kozen, Ed.). Vol. 131 of LNCS. Springer. pp. 52-71.
6. th IEEE Int. Symp. Intelligent Control.
7. Grumberg, O. and D. Long (1991). Model checking and modular verification. In: Proc. Int. Conf. on Concurrency Theory. Vol. 527 of LNCS. Springer. pp. 250-265.
8. Henzinger, T.A., R-H. Ho and H. Wong-Toi (1997). Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer 1(1/2), 110-122.
9. Henzinger, T.A., S. Qadeer and S.K. Rajamani (2000). Decomposing refinement proofs using assume-guarantee reasoning. In: Proc. IEEE Int. Conf. on Computer-Aided Design. IEEE Comp. Soc. Press. pp. 245-252.
10. th Int. Conf. on Computer-Aided Verification. Vol. 1427 of LNCS. Springer. pp. 440-451.
11. Hooman, J. (1997). Compositional verification of real-time applications. In: Proc. Compositionality - The Significant Difference. Vol. 1536 of LNCS Springer. pp. 276-300.
12. Jones, C.B. (1981). Development methods for computer programs including a notion of interference. PhD thesis. Oxford University Computing Laboratory.
13. Lynch, N. and Krogh, B. H., (Eds.) (2000). Hybrid Systems: Computation and Control (HSCC'OO). Vol. 1790 of LNCS Springer.
14. Misra, J. and K.M. Chandy (1981). Proofs of networks of processes. IEEE Trans. on Software Engineering 7(7), 417-426.
15. Pnueli, A. (1984). In transition for global to modular temporal reasoning about programs. In: Logics and Models of Concurrent Systems. Vol. 13 of NATO ASI-F. Springer.
16. th Int. Symp. on Progr. Vol. 137 of LNCS. Springer. pp. 337-351.
17. th Int. Conf. on Automation of Mixed Processes. pp. 73-78.