Entity usage

Showing below up to 38 results in range #1 to #38.

1. Flat Coalgebraic Fixed Point Logics: Label: en
2. Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations: Label: en
3. Communicating Transactions: Label: en
4. Representations of Petri Net Interactions: Label: en
5. Conditional Automata: A Tool for Safe Removal of Negligible Events: Label: en
6. A Communication Based Model for Games of Imperfect Information: Label: en
7. Modal Logic over Higher Dimensional Automata: Label: en
8. Reversing Higher-Order Pi: Label: en
9. Kleene, Rabin, and Scott Are Available: Label: en
10. Generic Forward and Backward Simulations II: Probabilistic Simulation: Label: en
11. A Linear Account of Session Types in the Pi Calculus: Label: en
12. On the Compositionality of Round Abstraction: Label: en
13. Theory by Process: Label: en
14. Reasoning about Optimistic Concurrency Using a Program Logic for History: Label: en
15. On the Use of Non-deterministic Automata for Presburger Arithmetic: Label: en
16. Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus: Label: en
17. Buffered Communication Analysis in Distributed Multiparty Sessions: Label: en
18. Termination in Impure Concurrent Languages: Label: en
19. Parameterized Verification of Ad Hoc Networks: Label: en
20. Multipebble Simulations for Alternating Automata: Label: en
21. Obliging Games: Label: en
22. Mean-Payoff Automaton Expressions: Label: en
23. Simulation Distances: Label: en
24. Session Types for Access and Information Flow Control: Label: en
25. Session Types as Intuitionistic Linear Propositions: Label: en
26. Stochastic Real-Time Games with Qualitative Timed Automata Objectives: Label: en
27. Nash Equilibria for Reachability Objectives in Multi-player Timed Games: Label: en
28. Bisimilarity of One-Counter Processes Is PSPACE-Complete: Label: en
29. A Theory of Design-by-Contract for Distributed Multiparty Interactions: Label: en
30. A Logic for True Concurrency: Label: en
31. A Geometric Approach to the Problem of Unique Decomposition of Processes: Label: en
32. From Multi to Single Stack Automata: Label: en
33. Information Flow in Interactive Systems: Label: en
34. Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification: Label: en
35. Learning I/O Automata: Label: en
36. Trust in Anonymity Networks: Label: en
37. Taming Distributed Asynchronous Systems: Label: en
38. Concurrency and Composition in a Stochastic World: Label: en