Mathematical control theory: deterministic systems
Mathematical control theory: deterministic systems
Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Constraint nets: a semantic model for hybrid dynamic systems
Theoretical Computer Science - Special issue on hybrid systems
Examples of stabilization with hybrid feedback
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Linear phase-portrait approximations for nonlinear hybrid systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Introduction to Hybrid Dynamical Systems
Introduction to Hybrid Dynamical Systems
Finite variability interpretation of monadic logic of order
Theoretical Computer Science
Timing analysis of asynchronous circuits using timed automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Functional Specification of Real-Time and Hybrid Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
From Finite Automata toward Hybrid Systems (Extended Abstract)
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Origins and Metamorphoses of The Trinity: Logic, Nets, Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Modelling of Complex Systems: Systems as Dataflow Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part II
From logic to theoretical computer science: an update
Pillars of computer science
Boris A. Trakhtenbrot: academic genealogy and publications
Pillars of computer science
| Hi-index | 0.00 |
Paradigms, in which continuous time is involved in cooperation with, or instead of, discrete time appear now in different areas related to automata, logic and interaction. Unfortunately, they are accompanied by a plethora of definitions, terminology and notation, which is not free of ad-hoc and ambiguous decisions. The overuse of definitions from scratch of intricate notions without a previous, explicit core of basic generic notions engenders further models and formalisms, and it is not clear where to stop. Hence (quoting J.Hartmanis), the challenge "to isolate the right concepts, to formulate the right models, and to discard many others, that do not capture the reality we want to understand...". We undertake this challenge wrt some automata-theoretic concepts and issues that appear in the literature on continuous-time circuits and hybrid automata, by keeping to the following guidelines:1. Building on Basic Automata Theory.2. Coherence with original or potential discrete-time paradigms, whose continuous-time analogs and/or mutants we would like to understand.3. Functions, notably input/output behavior of devices, should not be ignored in favor of sets (languages) accepted by them.The paper outlines the approach which emerged in previous research [PRT, RT, T3, T4, R] and in teaching experience [T0, T2]. As an illustration we offer a precise explanation of the evasive relationship between hybrid automata, constrained automata} and control circuits.