Taming the Infinities of Concurrency Essays Dedicated to Javier Esparza on the Occasion of His 60th Birthday
Javier Esparza received his primary degree in Theoretical Physics and in 1990 his PhD in Computer Science from the University of Zaragoza. After positions at the University of Hildesheim, the University of Edinburgh, and the Technical University of Munich, he then held professorships at the Universi...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Cham
Springer Nature Switzerland
2024, 2024
|
| Edition: | 1st ed. 2024 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Fairness and Liveness under Weak Consistency
- Restricted Flow Games
- SynthLearn: a Tool for Guided Reactive Synthesis
- On Regular Expression Proof Complexity of Salomaa’s Axiom System F1
- Hidden Markov Models with Unobservable Transitions
- Coverability in Well-Formed Free-Choice Petri Nets
- Devillers On verifying concurrent programs under weak consistency models: Decidability and Complexity
- A Summary and Personal Perspective on Recent Advances in Privacy Risk Assessment in Digital Pathology through Formal Methods
- A Uniform Framework for Language Inclusion Problems
- On the Home-Space Problem for Petri Nets
- Leroux Newton’s Method – There and Back Again
- Template-Based Verification of Array-Manipulating Programs
- Memoryless Strategies in Stochastic Reachability Games
- Region Quadtrees Verified
- Computing pre* for General Context Free Languages
- 2-Pointer Logic