Results 1 
5 of
5
Algebra of Networks  Modeling simple networks, as well as complex interactive systems
 In: Proof and SystemReliability, Proc. Marktoberdorf Summer School 2001, Kluwer (2002), 4978. A., Sofronia A., Stefanescu G.: Highlevel Structured Interactive
"... The rst part of the paper contains an overview of Network Algebra (NA) book [35]. The second part introduces nite interactive systems as an abstract mathematical model of agents' behaviour and their interaction. ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
The rst part of the paper contains an overview of Network Algebra (NA) book [35]. The second part introduces nite interactive systems as an abstract mathematical model of agents' behaviour and their interaction.
"Interactive systems"  from a natural language expression, to a mathematical concept
"... This paper gives a brief introduction to interactive systems, an abstract mathematical model of agents' behavior and their interaction. The paper contains the denition of interactive systems, examples, a few simple properties and a comparison with some other similar models. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper gives a brief introduction to interactive systems, an abstract mathematical model of agents' behavior and their interaction. The paper contains the denition of interactive systems, examples, a few simple properties and a comparison with some other similar models. 1
1 Research Summary
"... The primary focus of my research is to develop formal methods and tools which support the modeling and automated analysis of complex computational systems, including software systems, embedded systems and biological systems. The main emphasis is on approaches that scale well for realistic applicatio ..."
Abstract
 Add to MetaCart
(Show Context)
The primary focus of my research is to develop formal methods and tools which support the modeling and automated analysis of complex computational systems, including software systems, embedded systems and biological systems. The main emphasis is on approaches that scale well for realistic applications. My most notable contributions are in: Establishing a noncommutative CayleyHamilton theorem for finite automata; Showing that minimal nondeterministic finite automata may be related via linear transformations; Automatically detecting emergent properties in networks of cardiac myocytes; Automatically learning an efficient model for excitable cells; Defining a model checking technique that allows to trade time and space for precision and confidence; Defining compositional models for discrete and hybrid hierarchic automata, together with modular proof rules and search routines; Providing compositional semantics and refinement rules for UML sequence diagrams, and their automatic translation to statecharts; Providing an algebraic foundation of UMLRT in terms of trace categories; Giving a denotational semantics for dynamically reconfigurable systems. My work resulted in a number of publicly available tools, including model checkers jMocha, Hermes, Gmc and Tempo, and hybrid systems simulators Charon and Eha. Below is a brief description of this work, classified by projects and in inverse chronological order. Ongoing projects also contain a summary of future work. NextGeneration Model Checking and Abstract Interpretation: With a Focus on Embedded