Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 38 results in range #1 to #38.
- Probabilistic Robust Timed Games: Label: en
- Synchronizing Strategies under Partial Observability: Label: en
- Compositional Controller Synthesis for Stochastic Games: Label: en
- Synthesis from Component Libraries with Costs: Label: en
- Lost in Abstraction: Monotonicity in Multi-threaded Programs: Label: en
- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability: Label: en
- Parameterized Model Checking of Rendezvous Systems: Label: en
- Bisimulations Up-to: Beyond First-Order Transition Systems: Label: en
- Trees from Functions as Processes: Label: en
- Deadlock Analysis of Unbounded Process Networks: Label: en
- Choreographies, Logically: Label: en
- Generalized Bisimulation Metrics: Label: en
- Deterministic Negotiations: Concurrency for Free: Label: en
- The Benefits of Sometimes Not Being Discrete: Label: en
- Tight Game Abstractions of Probabilistic Automata: Label: en
- Adding Negative Prices to Priced Timed Games: Label: en
- Qualitative Concurrent Parity Games: Bounded Rationality: Label: en
- Reducing Clocks in Timed Automata while Preserving Bisimulation: Label: en
- Verification for Timed Automata Extended with Unbounded Discrete Data Structures: Label: en
- Ordered Navigation on Multi-attributed Data Words: Label: en
- (Un)decidable Problems about Reachability of Quantum Systems: Label: en
- A General Framework for Well-Structured Graph Transformation Systems: Label: en
- Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices: Label: en
- A Categorical Semantics of Signal Flow Graphs: Label: en
- Timed Multiparty Session Types: Label: en
- A Semantic Deconstruction of Session Types: Label: en
- Using Higher-Order Contracts to Model Session Types (Extended Abstract): Label: en
- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties: Label: en
- Bounds on Mobility: Label: en
- A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman’s Algorithm: Label: en
- A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups: Label: en
- Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking: Label: en
- Controllers for the Verification of Communicating Multi-pushdown Systems: Label: en
- Decidable Topologies for Communicating Automata with FIFO and Bag Channels: Label: en
- Averaging in LTL: Label: en
- Probabilistic Bisimulation: Naturally on Distributions: Label: en
- Robust Synchronization in Markov Decision Processes: Label: en
- Perturbation Analysis in Verification of Discrete-Time Markov Chains: Label: en