Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems

Authors:
Marcelo P. Fiore
Affiliations:
-
Venue:
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Year:
2000

Citing 9
Cited 0

Models for concurrency

Handbook of logic in computer science (vol. 4)
Communication and Concurrency

Communication and Concurrency
Back and Forth Bisimulations

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Obseving Behaviour Categorically

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Presheaf Models for Concurrency

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation and Open Maps

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Unique factorisation lifting functors and categories of linearly-controlled processes

Mathematical Structures in Computer Science
Premonoidal categories and notions of computation

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the rudiments of a unifying theory of general processes encompassing discrete, continuous, and hybrid systems. The main focus is on the study of process behaviour, but constructions on processes are also considered in some detail. In particular, we show that processes admit an abstract, conceptual treatment of bisimilarity via the notion of open map (as advocated by Winskel et al.). Furthermore, we present a tool-kit of categorical constructions on processes that can be regarded as the basis of a process description language. Within the general theory, typical operations of process calculi on discrete and hybrid systems are discussed.