Result 1 to 20 of 89 total
Unidirectional channel systems can be tested. (English)
Baeten, Jos C. M. (ed.) et al., Theoretical computer science. 7th IFIP TC 1/WG 2.2 international conference, TCS 2012, Amsterdam, The Netherlands, September 26‒28, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33474-0/pbk). Lecture Notes in Computer Science 7604, 149-163 (2012).
1
Complexity of deciding bisimilarity between normed BPA and normed BPP. (English)
Inf. Comput. 208, No. 10, 1193-1205 (2010).
2
Reachability games on extended vector addition systems with states. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-14161-4/pbk). Lecture Notes in Computer Science 6199, 478-489 (2010).
3
Bisimilarity of one-counter processes is PSPACE-complete. (English)
Gastin, Paul (ed.) et al., CONCUR 2010 ‒ concurrency theory. 21th international conference, CONCUR 2010, Paris, France, August 31 ‒ September 3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15374-7/pbk). Lecture Notes in Computer Science 6269, 177-191 (2010).
4
Reachability games on extended vector addition systems with states. (English)
Comput. Res. Repos. 2010, Article No. 1002.2557 (2010).
5
Non-interleaving bisimulation equivalences on basic parallel processes. (English)
Inf. Comput. 208, No. 1, 42-62 (2010).
6
Bisimilarity of one-counter processes is PSPACE-complete (English)
CONCUR, 177-191 (2010).
7
Reachability games on extended vector addition systems with states (English)
ICALP (2), 478-489 (2010).
8
Hardness of equivalence checking for composed finite-state systems. (English)
Acta Inf. 46, No. 3, 169-191 (2009).
9
On the complexity of consistency and complete state coding for signal transition graphs. (English)
Fundam. Inform. 86, No. 3, 227-253 (2008).
10
Undecidability of bisimilarity by defender’s forcing. (English)
J. ACM 55, No. 1 (2008).
11
Bouziane’s transformation of the Petri net reachability problem and incorrectness of the related algorithm. (English)
Inf. Comput. 206, No. 11, 1259-1263 (2008).
12
Normed BPA vs. normed BPP revisited. (English)
van Breugel, Franck (ed.) et al., CONCUR 2008 ‒ concurrency theory. 19th international conference, CONCUR 2008, Toronto, Canada, August 19‒22, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85360-2/pbk). Lecture Notes in Computer Science 5201, 434-446 (2008).
13
Selected ideas used for decidability and undecidability of bisimilarity. (English)
Ito, Masami (ed.) et al., Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85779-2/pbk). Lecture Notes in Computer Science 5257, 56-71 (2008).
14
Normed BPA vs. Normed BPP revisited (English)
CONCUR, 434-446 (2008).
15
Selected ideas used for decidability and undecidability of bisimilarity (English)
Developments in Language Theory, 56-71 (2008).
16
A note on emptiness for alternating finite automata with a one-letter alphabet. (English)
Inf. Process. Lett. 104, No. 5, 164-167 (2007).
17
Monotonicity of restarting automata. (English)
J. Autom. Lang. Comb. 12, No. 3, 355-371 (2007).
18
Monotonicity of restarting automata (English)
Journal of Automata, Languages and Combinatorics 12, No. 3, 355-371 (2007).
19
Undecidability results for bisimilarity on prefix rewrite systems. (English)
Aceto, Luca (ed.) et al., Foundations of software science and computation structures. 9th international conference, FOSSACS 2006, held as part of the joint European conferences on theory and practice of software, ETAPS 2006, Vienna, Austria, March 25‒31, 2006. Proceedings. Berlin: Springer (ISBN 3-540-33045-3/pbk). Lecture Notes in Computer Science 3921, 277-291 (2006).
20
Result 1 to 20 of 89 total
Start
Contact
Print
General Help
