Result 1 to 20 of 22 total
A framework for the evaluation of worst-case system efficiency. (English)
Comput. Res. Repos. 2011, Article No. 1105.1370 (2011).
1
Evaluating the efficiency of asynchronous systems with Fase. (English)
Comput. Res. Repos. 2011, Article No. 1105.1369 (2011).
2
Automated analysis of MUTEX algorithms with FASE (English)
GandALF, 45-59 (2011).
3
Read operators and their expressiveness in process algebras (English)
EXPRESS, 31-43 (2011).
4
Shape calculus. A spatial mobile calculus for 3D shapes (English)
Sci. Ann. Comp. Sci. 20, 1-31 (2010).
5
Timed operational semantics and well-formedness of shape calculus (English)
Sci. Ann. Comp. Sci. 20, 32-52 (2010).
6
Modeling and simulation of cardiac tissue using hybrid I/O automata. (English)
Theor. Comput. Sci. 410, No. 33-34, 3149-3165 (2009).
7
Liveness of a mutex algorithm in a fair process algebra. (English)
Acta Inf. 46, No. 3, 209-235 (2009).
8
Time and fairness in a process algebra with non-blocking reading. (English)
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24‒30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 193-204 (2009).
9
A shape calculus for biological processes (English)
ICTCS, 30-33 (2009).
10
Time and fairness in a process algebra with non-blocking Reading (English)
SOFSEM, 193-204 (2009).
11
Spatial networks of hybrid I/O automata for modeling excitable tissue. (English)
Electron. Notes Theor. Comput. Sci. 194, No. 3, 51-67 (2008).
12
Checking a mutex algorithm in a process algebra with fairness. (English)
Baier, Christel (ed.) et al., CONCUR 2006 ‒ concurrency theory. 17th international conference, CONCUR 2006, Bonn, Germany, August 27‒30, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-37376-6/pbk). Lecture Notes in Computer Science 4137, 142-157 (2006).
13
Fairness of actions in system computations. (English)
Acta Inf. 43, No. 2, 73-130 (2006).
14
Fairness of components in system computations. (English)
Theor. Comput. Sci. 356, No. 3, 291-324 (2006).
15
Checking a mutex algorithm in a process algebra with fairness (English)
CONCUR, 142-157 (2006).
16
Fairness of components in system computations. (English)
Electron. Notes Theor. Comput. Sci. 128, No. 2, 35-52 (2005).
17
Integrating ontologies in mobile agents (English)
WOA, 37-45 (2005).
18
Code mobility for pervasive computing (English)
WETICE, 431-432 (2004).
19
Relating fairness and timing in process algebras. (English)
Amadio, Roberto (ed.) et al., CONCUR 2003 ‒ concurrency theory. 14th international conference, Marseille, France, September 3‒5, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40753-7/pbk). Lect. Notes Comput. Sci. 2761, 446-460 (2003).
20
Result 1 to 20 of 22 total
Start
Contact
Print
General Help
