Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Concurrent object-oriented programming
Communications of the ACM
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Elements of interaction: Turing award lecture
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Denotational semantics in the cpo and metric approach
Theoretical Computer Science
An extensional treatment of lazy data flow deadlock
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 3)
Evolving algebras 1993: Lipari guide
Specification and validation methods
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Interaction categories and the foundations of typed concurrent programming
Proceedings of the NATO Advanced Study Institute on Deductive program design
Interactive foundations of computing
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Interval and point-based approaches to hybrid system verification
Interval and point-based approaches to hybrid system verification
VHDL design representation and synthesis (2nd ed.)
VHDL design representation and synthesis (2nd ed.)
YAPI: application modeling for signal processing systems
Proceedings of the 37th Annual Design Automation Conference
Strictly causal functions have a unique fixed point
Theoretical Computer Science
Communicating sequential processes
Communications of the ACM
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
The algebra of stream processing functions
Theoretical Computer Science
Discrete-event simulation
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Distributed Algorithms
Modeling concurrent real-time processes using discrete events
Annals of Software Engineering
Metric Spaces as Models for Real-Time Concurrency
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
A Kahn Principle for Networks of Nonmonotonic Real-time Processes
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Networks of Real-Time Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Hybrid Systems
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Principles of Object-Oriented Modeling and Simulation with Modelica 2.1
Principles of Object-Oriented Modeling and Simulation with Modelica 2.1
A behavioral type system and its application in Ptolemy II
Formal Aspects of Computing
A coinductive calculus of streams
Mathematical Structures in Computer Science
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Semantic foundation of the tagged signal model
Semantic foundation of the tagged signal model
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Concurrent semantics without the notions of state or state transitions
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Operational semantics of hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Modeling timed concurrent systems
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A framework for comparing models of computation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Actors without Directors: A Kahnian View of Heterogeneous Systems
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Proceedings of the 47th Design Automation Conference
Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude
Science of Computer Programming
On fixed points of strictly causal functions
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
On the verification of timed discrete-event models
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 5.23 |
We give a denotational framework for composing interactive components into closed or open systems and show how to adapt classical domain-theoretic approaches to open systems and to timed systems. For timed systems, prior approaches are based on temporal logics, automata theory, or metric spaces. In this paper, we base the semantics on a CPO with a prefix order, as has been done previously for untimed systems. We show that existence and uniqueness of behaviors are ensured by continuity with respect to this prefix order. Existence and uniqueness of behaviors, however, do not imply that a composition of components yields a useful behavior. The unique behavior could be empty or smaller than expected. We define liveness and show that appropriately defined causality conditions ensure liveness and freedom from Zeno conditions. In our formulation, causality does not require a metric and can embrace a wide variety of models of time.