On the public citation graph
Stochastic Reasoning About Channel-Based Component Connectors
0 signed · 62 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11925040_2openalex-snapshot
Modelling Coordination in Biological Systems
inferredcites →https://doi.org/10.1007/3-540-61604-7_63openalex-snapshot
Extended Markovian Process Algebra
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_5openalex-snapshot
Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes
inferredcites →https://doi.org/10.1007/978-3-540-39656-7_2openalex-snapshot
Abstract Behavior Types: A Foundation Model for Components and Their Composition
inferredcites →https://doi.org/10.1007/978-3-540-40020-2_2openalex-snapshot
A Coinductive Calculus of Component Connectors
inferredcites →https://doi.org/10.1007/978-3-540-45187-7_32openalex-snapshot
Comparative Branching-Time Semantics for Markov Chains
inferredcites →https://doi.org/10.1007/978-3-540-45232-4_8openalex-snapshot
The Modest Modeling Tool and Its Implementation
inferredcites →https://doi.org/10.1007/b100112openalex-snapshot
A checker for modal formulas for processes with data
inferredcites →https://doi.org/10.1016/j.entcs.2004.11.040openalex-snapshot
Continuous-Time Probabilistic KLAIM
inferredcites →https://doi.org/10.1016/j.entcs.2006.07.019openalex-snapshot
Trace Semantics for Stochastic Systems with Nondeterminism
inferredcites →https://doi.org/10.1016/j.ic.2005.03.001openalex-snapshot
Comparative branching-time semantics for Markov chains
inferredcites →https://doi.org/10.1016/j.scico.2004.05.010openalex-snapshot
Abstract Behavior Types: a foundation model for components and their composition
inferredcites →https://doi.org/10.1016/j.scico.2005.10.008openalex-snapshot
Modeling component connectors in Reo by constraint automata
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.022openalex-snapshot
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
inferredcites →https://doi.org/10.1016/s0304-3975(00)00096-7openalex-snapshot
Measure and probability for concurrency theorists
inferredcites →https://doi.org/10.1016/s1571-0661(04)80520-6openalex-snapshot
Revisiting Interactive Markov Chains
inferredcites →https://doi.org/10.1017/cbo9780511569951openalex-snapshot
A Compositional Approach to Performance Modelling
inferredcites →https://doi.org/10.1017/s0021900200107338openalex-snapshot
Exact and ordinary lumpability in finite Markov chains
inferredcites →https://doi.org/10.1017/s0960129503003943openalex-snapshot
A simple process algebra based on atomic actions with resources
inferredcites →https://doi.org/10.1017/s0960129504004153openalex-snapshot
Reo: a channel-based coordination model for component composition
inferredcites →https://doi.org/10.1109/sefm.2004.27openalex-snapshot
Models and temporal logics for timed component connectors
inferredcites →https://doi.org/10.1145/129630.129635openalex-snapshot
Coordination languages and their significance
inferredcites →https://doi.org/10.1145/130994.131005openalex-snapshot
Component-oriented software development
inferredcites →https://doi.org/10.1145/234528.234732openalex-snapshot
Coordination models and languages as software integrators
inferredcites →https://doi.org/10.1287/moor.1040.0089openalex-snapshot
Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach
inferredcites →https://doi.org/10.2307/2291177openalex-snapshot
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
inferredcites →https://doi.org/10.3217/jucs-000-00-0109openalex-snapshot
Journal of Universal Computer Science
inferredcites →https://doi.org/10.3217/jucs-011-10-1718openalex-snapshot
Probabilistic Models for Reo Connector Circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-00151-3_8openalex-snapshot
A Relational Model for Probabilistic Connectors Based on Timed Data Distribution Streams
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_12openalex-snapshot
Different Glasses to Look into the Three Cs: Component, Connector, Coordination
inferred← citeshttps://doi.org/10.1007/978-3-030-31517-7_4openalex-snapshot
Proof Guidance in PVS with Sequential Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-030-31517-7_5openalex-snapshot
Using PVS for Modeling and Verification of Probabilistic Connectors
inferred← citeshttps://doi.org/10.1007/978-3-319-18941-3_2openalex-snapshot
Coordinating Multicore Computing
inferred← citeshttps://doi.org/10.1007/978-3-319-70848-5_18openalex-snapshot
Capturing Stochastic and Real-Time Behavior in Reo Connectors
inferred← citeshttps://doi.org/10.1007/978-3-319-90089-6_3openalex-snapshot
Energy-Utility Analysis of Probabilistic Systems with Exogenous Coordination
inferred← citeshttps://doi.org/10.1007/978-3-540-72794-1_16openalex-snapshot
Component Connectors with QoS Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-540-72952-5_19openalex-snapshot
On Resource-Sensitive Timed Component Connectors
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_11openalex-snapshot
Recasting Constraint Automata into Büchi Automata
inferred← citeshttps://doi.org/10.1007/s10270-010-0152-1openalex-snapshot
Büchi automata for modeling component connectors
inferred← citeshttps://doi.org/10.1007/s11704-018-7395-3openalex-snapshot
Connection models for the Internet-of-Things
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.03.009openalex-snapshot
Q-Automata: Modelling the Resource Usage of Concurrent Components
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100531openalex-snapshot
Twenty years of coordination technologies: COORDINATION contribution to the state of art
inferred← citeshttps://doi.org/10.1016/j.scico.2010.05.004openalex-snapshot
Channel-based coordination via constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.scico.2011.11.007openalex-snapshot
A compositional model to reason about end-to-end QoS in Stochastic Reo connectors
inferred← citeshttps://doi.org/10.1016/j.scico.2015.09.001openalex-snapshot
Global consensus through local synchronization: A formal basis for partially-distributed coordination
inferred← citeshttps://doi.org/10.1016/j.scico.2019.02.005openalex-snapshot
A formal framework capturing real-time and stochastic behavior in connectors
inferred← citeshttps://doi.org/10.1109/access.2020.3004199openalex-snapshot
Proof Learning in PVS With Utility Pattern Mining
inferred← citeshttps://doi.org/10.1109/compsac.2017.172openalex-snapshot
Models of Connected Things: On Priced Probabilistic Timed Reo
inferred← citeshttps://doi.org/10.1109/rtest49666.2020.9140111openalex-snapshot
Simulation of Hybrid Reo Connectors
inferred← citeshttps://doi.org/10.1145/1244002.1244085openalex-snapshot
Web services choreography and orchestration in Reo and constraint automata
inferred← citeshttps://doi.org/10.1145/2554850.2555025openalex-snapshot
Quantitative analysis of Reo-based service coordination
inferred← citeshttps://doi.org/10.18293/seke2018-023openalex-snapshot
Towards Formal Modeling and Verification of Probabilistic Connectors in Coq (S)
inferred← citeshttps://doi.org/10.18293/seke2018-024openalex-snapshot
Reo2PVS: Formal Specification and Verification of Component Connectors
inferred← citeshttps://doi.org/10.4204/eptcs.30.7openalex-snapshot
A Compositional Semantics for Stochastic Reo Connectors
inferred← citeshttps://doi.org/10.7561/sacs.2012.1.201openalex-snapshot
Overview of Thirty Semantic Formalisms for Reo
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.