default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 467
Volume 467, January 2013
- Simone Bova, Franco Montagna:
Polynomial space hardness without disjunction property. 1-11 - Giorgio Delzanno, Fernando Rosa-Velardo
:
On the coverability and reachability languages of monotonic extensions of Petri nets. 12-29 - Romain Péchoux:
Synthesis of sup-interpretations: A survey. 30-52 - Markus N. Rabe, Sven Schewe:
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games. 53-67 - Ron van der Meyden, Chenyi Zhang:
Information flow in systems with schedulers, Part I: Definitions. 68-88 - Farn Wang:
Efficient model-checking of dense-time systems with time-convexity analysis. 89-108
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.
last updated on 2025-03-11 20:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
