Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Automata, Languages, and Machines
Automata, Languages, and Machines
Compositional Specification of Timed Systems (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Coalgebra, concurrency, and control
Coalgebra, concurrency, and control
Weak bisimulation for (max/+) automata and related models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Theoretical Computer Science - Logic, semantics and theory of programming
Supervisory Control of (max,+) Automata: A Behavioral Approach
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
An important class of timed transition systems can be modeled by deterministic weighted automata, which are essentially partial Mealy automata, and their extensions using synchronous compositions defined over extended alphabets. From a coalgebraic viewpoint, behaviours of deterministic partial Mealy automata are causal and length preserving partial functions between finite and infinite sequences of inputs and outputs, called stream functionals. After a study of fundamental properties of functional stream calculus an application to the definition by coinduction of the synchronous product of stream functionals is proposed.