Minimal realization in bicategories of automata

1998 ◽  
Vol 8 (2) ◽  
pp. 93-116 ◽  
Author(s):  
ROBERT ROSEBRUGH ◽  
N. SABADINI ◽  
R. F. C. WALTERS

The context of this article is the programme to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The objective here is to study reachability, minimization and minimal realization in these bicategories. In this setting the automata are 1-cells, in contrast with previous studies where they appeared as objects. As a consequence, we are able to study the relation of minimization and minimal realization to serial composition of automata using (co)lax (co)monads. We are led to define suitable behaviour categories and prove minimal realization theorems that extend classical results.

1993 ◽  
Vol 19 (3-4) ◽  
pp. 403-416
Author(s):  
David Murphy

The purpose of this paper is to present a real-timed concurrency theory in the noninterleaving tradition. The theory is based on the occurrences of actions; each occurrence or event has a start and a finish. Causality is modelled by assigning a strict partial order to these starts and finishes, while timing is modelled by giving them reals. The theory is presented in some detail. All of the traditional notions found in concurrency theories (such as conflict, confusion, liveness, and so on) are found to be expressible. Four notions of causality arise naturally from the model, leading to notions of securing. Three of the notions give rise to underlying event structures, demonstrating that our model generalises Winskel’s. Infinite structures are then analysed: a poset of finite structures is defined and suitably completed to give one containing infinite structures. These infinite structures are characterised as just those arising as limits of finite ones. Our technique here, which relies on the structure of time, is of independent interest.


Notes ◽  
1991 ◽  
Vol 48 (2) ◽  
pp. 497
Author(s):  
Jeffrey L. Prater ◽  
Roger W. H. Savage ◽  
Nachum Schoffman ◽  
Anne Trenkamp ◽  
John G. Suess
Keyword(s):  
Post War ◽  

Algorithms ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 136
Author(s):  
Manuel Duarte-Mermoud ◽  
Javier Gallegos ◽  
Norelys Aguila-Camacho ◽  
Rafael Castro-Linares

Adaptive and non-adaptive minimal realization (MR) fractional order observers (FOO) for linear time-invariant systems (LTIS) of a possibly different derivation order (mixed order observers, MOO) are studied in this paper. Conditions on the convergence and robustness are provided using a general framework which allows observing systems defined with any type of fractional order derivative (FOD). A qualitative discussion is presented to show that the derivation orders of the observer structure and for the parameter adjustment are relevant degrees of freedom for performance optimization. A control problem is developed to illustrate the application of the proposed observers.


Sign in / Sign up

Export Citation Format

Share Document