Repairing time-determinism in the process algebra for hybrid systems
Publication:442292
DOI10.1016/j.tcs.2012.05.027zbMath1282.68174OpenAlexW2096841663MaRDI QIDQ442292
U. Khadim, Pieter J. L. Cuijpers
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.027
hybrid systemsoperational semanticsprocess algebrabisimulationinconsistencyaxiomatic semanticsflow-determinismtime-determinism
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repairing time-determinism in the process algebra for hybrid systems
- Redesign of a systems engineering language: formalisation of \(\chi\)
- Process algebra with propositional signals
- Hybrid I/O automata.
- Hybrid process algebra
- Process algebra for hybrid systems
- Process algebra with timing
- Linearization of hybrid processes
- Syntax and consistent equation semantics of hybrid Chi
- Notions of bisimulation and congruence formats for SOS with data
- Psi-calculi: a framework for mobile processes with nominal data and logic
- Rule Formats for Distributivity
- HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour
- Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions
- A Rule Format for Associativity
- Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting
- Special issue: Hybrid Petri nets
This page was built for publication: Repairing time-determinism in the process algebra for hybrid systems
