In this talk I will present a method for constructing Mealy machines from arithmetic bitstream specifications. This method was described by Jan Rutten in his FACS'05 paper. David Costa and myself have implemented this synthesis procedure in Haskell, and experimental results have led to a conjecture on the minimal size …
read moreOntological Perspectives in Modelling the Electrical Power Grid
This talk surveys existing problems of assuring the stability and reliability of electrical power distribution systems. It describes what steps have been taken to model problems in these areas, and assesses the effectiveness of these models. In the process, gaps or deficiencies may be identified that Reo can address.
read moreControlling Object Allocation Using Creation Guards
Sharing of objects between different modules is often necessary to meet speed and resource demands. The invariants that describe properties of shared objects are difficult to maintain because they can be falsifiable by object allocation. In this talk, I introduce creation guards to obtain a sound and modular methodology that …
read moreReactive Objects as Components in Reo Circuits
Rebeca is an actor-based language for modeling concurrent and distributed systems using reactive objects. The possibility of mapping Rebeca models into the coordination language, Reo, is investigated and a natural mapping is presented. Reactive objects in Rebeca are considered as components in Reo, and their behavior is specified by constraint …
read moreInteraction: Conjectures, Results, Myths
It is commonly recognized that today's computing applications, such as web services, intelligent agents, operating systems, and graphical user interfaces, cannot be modeled by Turing machines and algorithms, which view computation as a closed box transformation of inputs to outputs.
According to the interactive view of computation, communication (input/output …
read moreConnector Colouring Semantic Model for Reo Connectors
The Connector Colouring Semantic Model aims at facilitate the data-flow computation (and implementation) of Reo connectors in a distributed computing environment. On our previous talk we presented the motivation and informally introduced and explained the connector colouring model working out the data-flow behaviour of some Reo connectors. Now, on this …
read moreBehavioral Logics and Abstraction
In this talk I will introduce behavioral logics, esp. hidden logic and hidden algebra. Circular coinduction and the proof tool BOBJ that implements circular rewriting of order sorted hidden logic will be presented. Weak behavioral semantics is introduced and motivated as appropriate for software development using algebraic techniques. A specification …
read moreASCII-Umwandlungsprache
We created a transformation language called ATL that can be used to define facts and rules in a convenient way also suitable for non-programmers. We show how this can be combined with a semantic tableau method to generate proofs, where the facts define axioms and the rules define theories. The …
read moreCoordination and Composition in Multi-Agent Systems
In this talk I will discuss the application of Reo to multi-agent systems. Reo supports a specific notion of compositionality for multi-agent systems which enables the composition and coordination of both individual agents as well as multi-agent systems. Accordingly, a multi-agent system consists of a set of individual and/or …
read morePower tools can make a difference
I will present a case study on applying Reo to solving some problems in designing and implementing negotiation protocols for e-Commerce. This presentation will generally follow the form of the talk I gave at the EEE'05 conference in Hong Kong. We will expand the more interesting to the ACG audience …
read more