scientific article; zbMATH DE number 683349
From MaRDI portal
Publication:4312468
Cited in
(17)- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- Truly concurrent constraint programming
- Decidability of infinite-state timed CCP processes and first-order LTL
- A multi-agent model for polarization under confirmation bias in social networks
- Models and emerging trends of concurrent constraint programming
- Timed term rewrite systems
- Bridging the gap between two concurrent constraint languages
- What is in a step: new perspectives on a classical question
- Modeling concurrent systems specified in a temporal concurrent constraint language. I
- The \textsf{tccp} interpreter
- Coordinating asynchronous and open distributed systems under semiring-based timing constraints
- Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming
- Non-determinism and Probabilities in Timed Concurrent Constraint Programming
- Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming
- A Formal Model for Polarization under Confirmation Bias in Social Networks
- Comparing three coordination models: Reo, ARC, and PBRD
- Models for concurrent constraint programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312468)