Result 1 to 20 of 170 total
Controllers with minimal observation power (application to timed systems). (English)
Chakraborty, Supratik (ed.) et al., Automated technology for verification and analysis. 10th international symposium, ATVA 2012, Thiruvananthapuram, India, October 3‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33385-9/pbk). Lecture Notes in Computer Science 7561, 223-237 (2012).
1
Quantitative languages defined by functional automata. (English)
Koutny, Maciej (ed.) et al., CONCUR 2012 ‒ concurrency theory. 23rd international conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32939-5/pbk). Lecture Notes in Computer Science 7454, 132-146 (2012).
2
Strategy synthesis for multi-dimensional quantitative objectives. (English)
Koutny, Maciej (ed.) et al., CONCUR 2012 ‒ concurrency theory. 23rd international conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32939-5/pbk). Lecture Notes in Computer Science 7454, 115-131 (2012).
3
Acacia+, a tool for LTL synthesis. (English)
Madhusudan, P. (ed.) et al., Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7‒13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31423-0/pbk). Lecture Notes in Computer Science 7358, 652-657 (2012).
4
Antichains and compositional algorithms for LTL synthesis. (English)
Form. Methods Syst. Des. 39, No. 3, 261-296 (2011).
5
Antichain-based QBF solving. (English)
Bultan, Tevfik (ed.) et al., Automated technology for verification and analysis. 9th international symposium, ATVA 2011, Taipei, Taiwan, October 11‒14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24371-4/pbk). Lecture Notes in Computer Science 6996, 183-197 (2011).
6
Reachability problems for hybrid automata. (English)
Delzanno, Giorgio (ed.) et al., Reachability problems. 5th international workshop, RP 2011, Genoa, Italy, September 28‒30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24287-8/pbk). Lecture Notes in Computer Science 6945, 28-30 (2011).
7
Event clock automata: From theory to practice. (English)
Fahrenberg, Uli (ed.) et al., Formal modeling and analysis of timed systems. 9th international conference, FORMATS 2011, Aalborg, Denmark, September 21‒23, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24309-7/pbk). Lecture Notes in Computer Science 6919, 209-224 (2011).
8
Games with imperfect information: theory and algorithms. (English)
Apt, Krzysztof R. (ed.) et al., Lectures in game theory for computer scientists. Cambridge: Cambridge University Press (ISBN 978-0-521-19866-0/hbk). 185-212 (2011).
9
On reachability for hybrid automata over bounded time. (English)
Comput. Res. Repos. 2011, Article No. 1104.5335 (2011).
10
On reachability for hybrid automata over bounded time. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 416-427 (2011).
11
Faster algorithms for mean-payoff games. (English)
Form. Methods Syst. Des. 38, No. 2, 97-118 (2011).
12
Impact of neutron irradiation on the RF properties of oxidized high-resistivity silicon substrates with and without a trap-rich passivation layer (English)
Microelectronics Reliability 51, No. 2, 326-331 (2011).
13
On reachability for hybrid automata over bounded time (English)
ICALP (2), 416-427 (2011).
14
Event clock automata: from theory to practice (English)
FORMATS, 209-224 (2011).
15
Antichain-based QBF solving (English)
ATVA, 183-197 (2011).
16
Reachability problems for hybrid automata (English)
RP, 28-30 (2011).
17
Generalized mean-payoff and energy games. (English)
Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPICS ‒ Leibniz International Proceedings in Informatics 8, 505-516, electronic only (2010).
18
Fixed point guided abstraction refinement for alternating automata. (English)
Theor. Comput. Sci. 411, No. 38-39, 3444-3459 (2010).
19
Lattice-valued binary decision diagrams. (English)
Bouajjani, Ahmed (ed.) et al., Automated technology for verification and analysis. 8th international symposium, ATVA 2010, Singapore, September 21-24, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15642-7/pbk). Lecture Notes in Computer Science 6252, 158-172 (2010).
20
Result 1 to 20 of 170 total
Start
Contact
Print
General Help
