Semantics of concurrent systems: a modular fixed-point trace approach
Advances in Petri Nets 1984
Parallel program design: a foundation
Parallel program design: a foundation
Mathematical control theory: deterministic systems
Mathematical control theory: deterministic systems
Verification of sequential and concurrent programs
Verification of sequential and concurrent programs
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Compositional proofs for networks of processes
Fundamenta Informaticae
Examples of stabilization with hybrid feedback
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Interconnected automata and linear systems: a theoretical framework in discrete-time
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Program Verification
Communication and Concurrency
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
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
Decomposing Real-Time Specifications
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
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
An Old-Fashioned Recipe for Real Time
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
Some definitional suggestions for automata theory
Journal of Computer and System Sciences
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
| Hi-index | 0.00 |
There is a growing feeling in the community that the current literature on reactive and hybrid systems is plagued by a Babel of models, constructs and formalisms, and by an amazing discord of terminology and notation. Further models and formalisms are engendered, and it is not clear where to stop. Hence, the urge toward a pithy conceptual/notational setting, supported by a consistent and comprehensive taxonomy for a wide range of formalisms and models. The paper outlines an automata-based approach to this challenge, which emerged in previous research [PRT, RT] and in teaching experience [T1, T2]. We compare our definitional suggestions with similar background in the current literature, where the subject is sometimes complicated by a premature mixture of semantics, syntax and pragmatics.