Cited By
View all- Trakhtenbrot B(2001)Automata, Circuits, and Hybrids: Facets of Continuous TimeAutomata, Languages and Programming10.1007/3-540-48224-5_2(4-23)Online publication date: 4-Jul-2001
Automata, circuits and hybrids: facets of continuous time
Pages 754 - 755
Abstract
No abstract available.
References
[1]
{1} Alur, A., Courcoubetis, C., Henzinger, T., Pei-Sin, Ho. Hybrid automata: approach to the specification and verification of hybrid systems. LNCS 736 (1993) 209- 229.
[2]
{2} Asarin E., Bournez O., Dang Th., Maler O., Pnueli A. Effective synthesis of switching controllers for linear systems. In Proceedings of the IEEE, vol. 88, no. 7, July 2000.
[3]
{3} Burks, A. W., Wright, J. B. Theory of logical nets. In Proceedings of the I. R. E., 1953.
[4]
{4} Henzinger, T. The theory of hybrid automata. In Proceedings of the IEEE (1996) 278-292.
[5]
{5} Maler, O., Pnueli, A. Timing analysis of asynchronous circuits using timed automata. In Proceedings CHARME'95, LNCS 987, pp. 189-205.
[6]
{6} Manna, Z., Pnueli, A. Models for reactivity. Acta Informatica 30 (1993) 609-678.
[7]
{7} Pardo, D., Rabinovich, A., Trakhtenbrot, B. A. On synchronous circuits over continuous time. Technical Report, Tel Aviv University, 1997.
[8]
{8} Rabinovich, A. Finite automata over continuous time. Technical Report, Tel Aviv University, 1996.
[9]
{9} Rabinovich, A., Trakhtenbrot, B. From finite automata toward hybrid systems. In Proceedings FCT'97, LNCS.
[10]
{10} Sontag, E. Mathematical control theory: Deterministic finite dimensional systems. Springer, N. Y., 1990.
[11]
{11} Trakhtenbrot, B. A. Automata and hybrid systems. Lecture Notes on a course at Uppsala University, Fall 1997.
[12]
{12} Trakhtenbrot, B. A. Origins and metamorphose of the trinity: Logics, nets, automata. In Proceedings LICS'95.
[13]
{13} Trakhtenbrot, B. A. Automata and their interaction: Definitional suggestions. FCT99, LNCS 1684, 1999, 54-89.
Index Terms
- Automata, circuits and hybrids: facets of continuous time
Recommendations
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Simulation of one-way cellular automata by boolean circuits
We present a relationship between two major models of parallel computation: the one-way cellular automata and the boolean circuits. The starting point is the boolean circuit of small depth designed by Ladner and Fischer to simulate any rational ...
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Comments
Information & Contributors
Information
Published In
July 2001
755 pages
Copyright © 2001 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 July 2001
Check for updates
Qualifiers
- Article
Conference
STOC01
Sponsor:
Acceptance Rates
STOC '01 Paper Acceptance Rate 83 of 230 submissions, 36%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 18Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
Cited By
View all- Trakhtenbrot B(2001)Automata, Circuits, and Hybrids: Facets of Continuous TimeAutomata, Languages and Programming10.1007/3-540-48224-5_2(4-23)Online publication date: 4-Jul-2001
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in