Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Baeten, Jos C.M."'
Publikováno v:
In Information and Computation October 2013 231:143-166
Autor:
Baeten, Jos C.M., Luttik, Bas
Publikováno v:
In Theoretical Computer Science 2011 412(28):3090-3100
Autor:
Baeten, Jos C.M., Bravetti, Mario
Publikováno v:
In Electronic Notes in Theoretical Computer Science 29 September 2006 162:65-71
Autor:
Baeten, Jos C.M., Sangiorgi, Davide
Publikováno v:
In Handbook of the History of Logic 2014 9:399-442
Autor:
Bergstra, J.A., Bethke, I., Baeten, Jos C.M., Lenstra, Jan Karel, Parrow, Joachim, Woeginger, Gerhard J.
Publikováno v:
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 2719, 1-21
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::b122732641f7549ee55c8ecfdf80ef83
https://dare.uva.nl/personal/pure/en/publications/polarized-process-algebra-and-program-equivalence(d760b502-1f2d-4941-8fb6-74af62cfe959).html
https://dare.uva.nl/personal/pure/en/publications/polarized-process-algebra-and-program-equivalence(d760b502-1f2d-4941-8fb6-74af62cfe959).html
Publikováno v:
CONCUR’99 Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24—27, 1999 Proceedings, 146-162
STARTPAGE=146;ENDPAGE=162;TITLE=CONCUR’99 Concurrency Theory
STARTPAGE=146;ENDPAGE=162;TITLE=CONCUR’99 Concurrency Theory
This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al. [1] The considered logic contains a time-bounded until-operator and a novel operator to e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::83dbf8be74fa5204af553cd8524bf105
https://research.utwente.nl/en/publications/11fd2818-3307-4a47-a67e-dbd6d190c6f9
https://research.utwente.nl/en/publications/11fd2818-3307-4a47-a67e-dbd6d190c6f9
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540544302
CONCUR
ISSUE=2;STARTPAGE=495;ENDPAGE=509;TITLE=2nd International Conference on Concurrency Theory, CONCUR 1991
CONCUR
ISSUE=2;STARTPAGE=495;ENDPAGE=509;TITLE=2nd International Conference on Concurrency Theory, CONCUR 1991
In this paper, we present a number of closely related models of process algebra, called finite-graph models. In a finite-graph model of process algebra, each process is a bisimulafion class of a particular kind of process graphs, called recursive pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa45fcdc5e086f11fb57d7ebb0669ba0
https://doi.org/10.1007/3-540-54430-5_109
https://doi.org/10.1007/3-540-54430-5_109
Publikováno v:
In Theoretical Computer Science 2007 379(3):305-305
Autor:
Baeten, Jos C.M., Phillips, Iain C.C.
Publikováno v:
In Theoretical Computer Science 2007 386(3):167-168