![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 594
Volume 594, August 2015
- Rodrigo Machado, Leila Ribeiro, Reiko Heckel:
Rule-based transformation of graph rewriting rules: Towards higher-order graph grammars. 1-23 - S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Checking conformance for time-constrained scenario-based specifications. 24-43 - A. R. Shir Ali Nasab, S. N. Hosseini:
Partial pullback complement rewriting. 44-64 - Armando B. Matos:
The efficiency of primitive recursive functions: A programmer's view. 65-81 - Zoltán Fülöp, Heiko Vogler:
Characterizing weighted MSO for trees by branching transitive closure logics. 82-105 - Markus Teichmann, Johannes Osterholzer:
A link between multioperator and tree valuation automata and logics. 106-119 - Nisansala Yatapanage
, Kirsten Winter:
Next-preserving branching bisimulation. 120-142 - Xiaodong Jia
, Achim Jung, Hui Kou, Qingguo Li
, Haoran Zhao:
All cartesian closed categories of quasicontinuous domains consist of domains. 143-150 - Sohei Ito
, Takuma Ichinose, Masaya Shimakawa, Naoko Izumi, Shigeki Hagihara
, Naoki Yonezaki:
Qualitative analysis of gene regulatory networks by temporal logic. 151-179 - Rachid Rebiha, Arnaldo Vieira Moura, Nadir Matringe:
Generating invariants for non-linear hybrid systems. 180-200 - Tim French
, John Christopher McCabe-Dansted, Mark Reynolds
:
Synthesis for continuous time. 201-222
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.