A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
RTsynchronizer: language support for real-time specifications in distributed systems
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Coordination as Comstrainted Interaction (Extended Abstract)
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Principles of Constraint Programming
Principles of Constraint Programming
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
SAT-based Abstraction Refinement for Real-time Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata for Context-Dependent Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
SAT-based Verification for Timed Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal modeling
Node coordination in peer-to-peer networks
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
From Timed Reo Networks to Networks of Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Increasing sizes of present-day distributed software systems call for coordination models which are both modular and scalable. Precise modelling of real-life applications further requires the notion of real-time. In this paper, we present a modular formal development of a compositional model for real-time coordination in dataflow networks. While real-time dataflow networks are typically asynchronous, our approach includes coordination patterns which combine, but are not limited to, synchrony and asynchrony. We define a constraint- and SAT-based encoding, which allows us to benefit from high-end constraint solving techniques when inspecting valid interactions of the system.