default search action
Theoretical Computer Science, Volume 138
Volume 138, Number 1, 6 February 1995
- Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, Thomas A. Henzinger, Pei-Hsin Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, Sergio Yovine:
The Algorithmic Analysis of Hybrid Systems. 3-34 - Eugene Asarin, Oded Maler, Amir Pnueli:
Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives. 35-65 - Michael S. Branicky:
Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems. 67-100 - Robert L. Grossman, Richard G. Larson:
An Algebraic Approach to Hybrid Systems. 101-112 - Michael R. Hansen, Paritosh K. Pandya, Zhou Chaochen:
Finite Divergence. 113-139 - Wolf Kohn, Anil Nerode, Jeffrey B. Remmel, Alexander Yakhnis:
Viability in Hybrid Systems. 141-168 - Yassine Lakhnech, Jozef Hooman:
Metric Temporal Logic with Durations. 169-199 - Michael D. Lemmon, Panos J. Antsaklis:
Inductively Inferring Valid Logical Models of Continuous-State Dynamical Systems. 201-210 - Ying Zhang, Alan K. Mackworth:
Constraint Nets: A Semantic Model for Hybrid Dynamic Systems. 211-239
Volume 138, Number 2, 20 February 1995
Part III: Concurrency Theory
- Jim Davies, Steve A. Schneider:
A Brief History of Timed CSP. 243-271 - Michael W. Mislove, A. W. Roscoe, Steve A. Schneider:
Fixed Points Without Completeness. 273-314 - Gavin Lowe:
Probabilistic and Prioritized Models of Timed CSP. 315-352 - Matthew Hennessy, Huimin Lin:
Symbolic Bisimulations. 353-389 - Rocco De Nicola, Roberto Segala:
A Process Algebraic View of Input/Output Automata. 391-423 - G. Michele Pinna, Axel Poigné:
On the Nature of Events: Another Perspective in Concurrency. 425-454
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.