@InProceedings{Perin+:Coordina'97:ModelingRailway,
  author    = 	 {Holzbacher, A. A. and Périn, M. and Südholt, M.},
  title     = 	 "{Modeling railway control systems using graph grammars: a case study}",
  booktitle =	 {Proceedings of the Second Conference on Coordination Models, Languages and Applications},
  month     =	 sep,
  year      =	 1997,
  NOaddress =	 {Berlin},
  series    =	 {LNCS},
  publisher =    "Springer-Verlag",
  volume    =	 {1282},
  pages     =	 {172-186},
  keywords  =	 {Software Architecture, Graph Grammars, Graph Rewriting, Consistency Checking},
  abstract  =    {In this paper we develop in three phases a railway control system        
		  following the requirements of [Coo97]. We are mainly concerned with      
		  the software architecture of the control system and its dynamic          
		  evolution; we do not discuss here the implementation details of the      
		  components forming the control system. First, we informally discuss      
		  our design proposal for the architecture of the control system: a        
		  hierarchy of controllers whose leaves are local controllers connected    
		  in a network that mimics the underlying railway topology. Second, we     
		  formally define by means of particular graph grammars a style of         
		  software architectures for the railway control system consisting of      
		  two complementary views and ensuring several desirable properties by     
		  construction. The dynamic evolution of the architecture is modelled by   
		  a set of coordination rules which define graph transformations and are   
		  verified with respect to the graph grammar. Third, using a               
		  coordination rule as a formal specification of a dynamic modification    
		  of the railway control system, we derive its implementation in           
		  ConCoord, a programming environment for concurrent coordinated           
		  programming. With regard to software engineering, the two first phases   
		  belong to the system design while the third one forms the first          
		  implementation step.},
}

 

