The Φ-calculus: A language for distributed control of reconfigurable embedded systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2623, Issue , 2003, Pages 435-449

  Rounds, William C ^a   Song, Hosung ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED PARAMETER CONTROL SYSTEMS; EMBEDDED SYSTEMS; HYBRID SYSTEMS;

ACTIVE ENVIRONMENTS; DISTRIBUTED CONTROL; HYBRID AUTOMATONS; PHYSICAL AGENTS; PI CALCULUS; RECONFIGURABLE EMBEDDED SYSTEMS;

CALCULATIONS;

EID: 35248819676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36580-x_32     Document Type: Article

References (16)

1. R. Alur, R. Grosu, I. Lee, and O. Sokolsky. Compositional refinement for hierarchical hybrid systems. In Maria Domenica Di Benedetto and Alberto Sangiovanni-Vincentelli, editors, Hybrid Systems, Computation, and Control, pages 33-48. Springer-Verlag, 2001. Volume 2034 of Lecture Notes in Computer Science.
2. R. Alur and. T. A. Henzinger. Reactive modules. Formal methods in System Design, 15:7-48, 1999.
3. S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. J. Assoc. Comput. Mach., 31(3):560-599, 1984.
4. Luis Caires and Luca Cardelli. A spatial logic for concurrency (part i). In Proceedings, Theoretical Aspects of Computer Software; 4th International Symposium, Sendai, Japan, 2001. To appear in I & C special issue on TACS'01.
5. A. Deshpande, A. Gollu, and L. Semenzato. The shift programming language and run-time system for dynamic networks of hybrid automata. Technical report, California PATH Research Report UCB-ITS-PRR-97-7, 1997.
6. T. A. Henzinger. The theory of hybrid automata. In Proc. 11th Annual Symposium on Logic in Computer Science, pages 278-292, 1996.
7. T. A. Henzinger, M. Minea, and V. Prabhu. Assume-guarantee reasoning for hierarchical hybrid systems. In Maria Domenica Di Benedetto and Alberto Sangiovanni-Vincentelli, editors, Hybrid Systems, Computation, and Control, pages 275-290. Springer-Verlag, 2001. Volume 2034 of Lecture Notes in Computer Science.
8. E. Klavins. Automatic compilation of concurrent hybrid factories from product assembly specifications. In Hybrid Systems: Computation and Control, LNCS 1790, pages 174-187, Pittsburgh, PA, 2000. Springer-Verlag.
9. Eric Klavins and Daniel Koditschek. A formalism for the composition of loosely coupled robot behaviors. Technical report, University of Michigan CSE Tech Report CSE-TR-12-99, 1999.
10. Daniel E. Koditschek and Elon Rimon. Robot navigation functions on manifolds with boundary. Advances in Applied Mathematics, 11:412-442, 1990.
11. Nancy Lynch, Roberto Segala, and Frits Vaandrager. Hybrid i/o automata revisited. In Maria Domenica Di Benedetto and Alberto Sangiovanni-Vincentelli, editors, Hybrid Systems: Computation and Control. Fourth International Workshop, pages 403-417. Springer-Verlag, 2001. Volume 2034 of Lecture Notes in Computer Science.
12. Nancy Lynch and Mark Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of 6th Annual Symposium on Principles of Distributed Computing, pages 137-151, 1987.
13. Robin Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.
14. W. C. Rounds and Hosung Song. The φ-calculus - a hybrid extension of the π-calculus to embedded systems. Technical report, University of Michigan EECS-CSE Tech Report CSE-TR-458-02, 2002.
15. Steve Schneider. Concurrent and real-time systems: the CSP approach. Wiley, 2000.
16. Roberto Segala. A process-algebraic view of i-o automata. Technical report, MIT Tech Memo MIT/LCS/TR557, 1992.