Pages that link to "Item:Q1050111"
From MaRDI portal
The following pages link to Calculi for synchrony and asynchrony (Q1050111):
Displaying 50 items.
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability (Q1575646) (← links)
- Additive models of probabilistic processes (Q1607220) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- Event algebra for transition systems composition application to timed automata (Q1656550) (← links)
- Quantitative analysis of software approximate correctness (Q1664851) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Congruent weak bisimulation with dense real-time (Q1802058) (← links)
- Priority as extremal probability (Q1816921) (← links)
- Amalgamation of graph transformations: a synchronization mechanism (Q1822505) (← links)
- Bisimulation of automata (Q1822987) (← links)
- An algebraic framework for urgency (Q1854390) (← links)
- On fairness notions in distributed systems. I: A characterization of implementability (Q1854419) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Asynchronous communication model based on linear logic (Q1898813) (← links)
- A theory of bisimulation for the \(\pi\)-calculus (Q1901699) (← links)
- Architectural CCS (Q1914040) (← links)
- Encoding fairness in a synchronous concurrent program algebra (Q2024348) (← links)
- Bialgebraic foundations for the operational semantics of string diagrams (Q2051792) (← links)
- Sound reasoning in \textit{tock}-CSP (Q2120813) (← links)
- SMT-based generation of symbolic automata (Q2182674) (← links)
- Introducing synchrony in fuzzy automata (Q2219075) (← links)
- A functional model for describing and reasoning about time behaviour of computing systems (Q2265792) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- A linear-time-branching-time spectrum for behavioral specification theories (Q2291820) (← links)
- Computable processes and bisimulation equivalence (Q2365394) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
- A synchronous \(\pi\)-calculus (Q2381508) (← links)
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency (Q2414249) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- Support measures for graph data (Q2508500) (← links)
- Final coalgebras and the Hennessy-Milner property (Q2576941) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Decomposing monolithic processes in a process algebra with multi-actions (Q2693301) (← links)
- The Expressive Power of Monotonic Parallel Composition (Q2802500) (← links)
- Distributed Synthesis in Continuous Time (Q2811352) (← links)
- Probabilistic model of software approximate correctness (Q2825263) (← links)
- A categorical framework for typing CCS-style process communication (Q2841310) (← links)
- Petri nets with causal time for system verification (Q2842866) (← links)
- Systems modelling via resources and processes: philosophy, calculus, semantics, and logic (Q2864163) (← links)
- Relating Coalgebraic Notions of Bisimulation (Q2888487) (← links)
- Extending modal transition systems with structured labels (Q2909731) (← links)
- Deciding the Bisimilarity Relation between Datalog Goals (Q2915060) (← links)
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories (Q2971124) (← links)
- On the Semantics of Markov Automata (Q3012929) (← links)
- Broadcast Psi-calculi with an Application to Wireless Protocols (Q3095234) (← links)
- How to Reason Coinductively Informally (Q3305562) (← links)
- (Q3385651) (← links)
