Fixing Zeno gaps
From MaRDI portal
Publication:549197
DOI10.1016/j.tcs.2011.03.018zbMath1227.68079MaRDI QIDQ549197
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/38909/38909.pdf
68Q70: Algebraic theory of languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
37N99: Applications of dynamical systems
68Q99: Theory of computing
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kleene getting lazy
- Properties of data flow frameworks: A unified model
- An algebra of hybrid systems
- Algebra of communicating processes with abstraction
- Unique fixed points vs. least fixed points
- A completeness theorem for Kleene algebras and the algebra of regular events
- Process algebra with propositional signals
- Process algebra for hybrid systems
- Process algebra with timing
- A fixpoint theory for non-monotonic parallelism
- On the regularization of Zeno hybrid automata
- Regular expressions and the equivalence of programs
- The common algebraic structure of exit-automata and machines
- A lattice-theoretical fixpoint theorem and its applications
- Specification and Development of Interactive Systems
- KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
- Automated Reasoning in Kleene Algebra
- Process Algebra
- Bases for Chain-complete Posets
- The Theoretical Aspects of the Optimal Fixedpoint
- Temporal algebra
- Equational axioms for regular sets
- Hybrid Systems: Computation and Control
- Relational Methods in Computer Science
