Result 1 to 20 of 49 total
Fine-grained concurrency with separation logic. (English)
J. Philos. Log. 40, No. 5, 583-632 (2011).
1
Parameterized complexity results for 1-safe Petri nets. (English)
Katoen, Joost-Pieter (ed.) et al., CONCUR 2011 ‒ concurrency theory. 22nd international conference, CONCUR 2011, Aachen, Germany, September 6‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23216-9/pbk). Lecture Notes in Computer Science 6901, 358-372 (2011).
2
Kleene theorems for product systems. (English)
Holzer, Markus (ed.) et al., Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25‒27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22599-4/pbk). Lecture Notes in Computer Science 6808, 235-247 (2011).
3
Parameterized complexity results for 1-safe Petri nets. (English)
Comput. Res. Repos. 2011, Article No. 1106.2122 (2011).
4
Parameterized complexity results for 1-safe Petri nets (English)
CONCUR, 358-372 (2011).
5
Kleene theorems for product systems (English)
DCFS, 235-247 (2011).
6
IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. (English)
LIPICS ‒ Leibniz International Proceedings in Informatics 8. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). 516~p., electronic. (2010).
7
LTL can be more succinct. (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, 245-258 (2010).
8
Around dot depth two. (English)
Gao, Yuan (ed.) et al., Developments in language theory. 14th international conference, DLT 2010, London, ON, Canada, August 17‒20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14454-7/pbk). Lecture Notes in Computer Science 6224, 303-315 (2010).
9
LTL can be more succinct (English)
ATVA, 245-258 (2010).
10
Around dot depth two (English)
Developments in Language Theory, 303-315 (2010).
11
Frontmatter, table of contents, preface, conference organization, author index (English)
FSTTCS (2010).
12
IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2010, December 15-18, 2010, Chennai, India (English)
LIPIcs: FSTTCS 8 (2010).
13
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. (English)
Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15‒17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPICS ‒ Leibniz International Proceedings in Informatics 4, 347-358, electronic only (2009).
14
Folding systems of communicating agents. (English)
Lodaya, Kamal (ed.) et al., Perspectives in concurrency. A Festschrift for P. S. Thiagarajan. Hyderabad: Universities Press; Boca Raton, FL: CRC Press (ISBN 978-1-4398-0943-3/hbk). 317-333 (2009).
15
Perspectives in concurrency. A Festschrift for P. S. Thiagarajan. (English)
Hyderabad: Universities Press; Boca Raton, FL: CRC Press (ISBN 978-1-4398-0943-3/hbk). vi, 506~p. \$~89.95 (2009).
16
Modelchecking counting properties of 1-safe nets with buffers in parapspace (English)
FSTTCS, 347-358 (2009).
17
Marking time. (English)
Chakraborty, Mihir K. (ed.) et al., Logic, Navya-Nyāya and applications. Homage to Bimal Krishna Matilal. Selected papers from the international conference on logic, Navya-Nyāya and applications, Kolkata, India, January 3‒7, 2007. London: College Publications (ISBN 978-1-904987-44-4/pbk). Studies in Logic (London) 15, 185-203 (2008).
18
Analyzing reachability for some Petri nets with fast growing markings. (English)
Electron. Notes Theor. Comput. Sci. 223, 215-237 (2008).
19
Marking the chops: an unambiguous temporal logic (English)
IFIP TCS, 461-476 (2008).
20
Result 1 to 20 of 49 total