Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Computer Science – Theory and Applications: 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings > Compositional Design of Stochastic Timed Automata
Computer Science – Theory and Applications: 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings |
Alexander S. Kulikov; Gerhard J. Woeginger
Springer International Publishing
Computer Science – Theory and Applications: 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings
Compositional Design of Stochastic Timed Automata
Authors

Patricia Bouyer; Thomas Brihaye; Pierre Carlier; Quentin Menet

ARI Id

1664868836486_3854707

Access

Not Available Free

Pages

117-130

DOI

10.1007/978-3-319-34171-2_9

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-34171-2_9

Table of Contents of Book
Showing 1 to 20 of 31 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XXI
On High-Quality Synthesis
Orna Kupferman
1-15
Sensitivity Versus Certificate Complexity of Boolean Functions
Andris Ambainis; Krišjānis Prūsis; Jevgēnijs Vihrovs
16-28
Algorithmic Decidability of Engel’s Property for Automaton Groups
Laurent Bartholdi
29-40
The Next Whisky Bar
Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer
41-56
Parameterizing Edge Modification Problems Above Lower Bounds
René van Bevern; Vincent Froese; Christian Komusiewicz
57-72
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing
René van Bevern; Artem V. Pyatkin
73-87
Max-Closed Semilinear Constraint Satisfaction
Manuel Bodirsky; Marcello Mamino
88-101
Computing and Listing st-Paths in Public Transportation Networks
Kateřina Böhmová; Matúš Mihalák; Tobias Pröger; Gustavo Sacomoto; Marie-France Sagot
102-116
Compositional Design of Stochastic Timed Automata
Patricia Bouyer; Thomas Brihaye; Pierre Carlier; Quentin Menet
117-130
Online Bounded Analysis
Joan Boyar; Leah Epstein; Lene M. Favrholdt; Kim S. Larsen; Asaf Levin
131-145
Affine Computation and Affine Automaton
Alejandro Díaz-Caro; Abuzer Yakaryılmaz
146-160
On Approximating (Connected) 2-Edge Dominating Set by a Tree
Toshihiro Fujito; Tomoaki Shimoda
161-176
Graph Editing to a Given Degree Sequence
Petr A. Golovach; George B. Mertzios
177-191
Subclasses of Baxter Permutations Based on Pattern Avoidance
Shankar Balachandran; Sajin Koroth
192-206
On Slepian–Wolf Theorem with Interaction
Alexander Kozachinskiy
207-222
Level Two of the Quantifier Alternation Hierarchy over Infinite Words
Manfred Kufleitner; Tobias Walter
223-236
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
Manfred Kufleitner; Jan Philipp Wächter
237-250
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
Meena Mahajan; Nitin Saurabh
251-265
Sums of Read-Once Formulas: How Many Summands Suffice?
Meena Mahajan; Anuj Tawari
266-279
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 31 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings