Sciweavers

396 search results - page 50 / 80
» Factor Automata of Automata and Applications
Sort
View
ZUM
1998
Springer
111views Formal Methods» more  ZUM 1998»
13 years 11 months ago
Combining Specification Techniques for Processes, Data and Time
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
Ernst-Rüdiger Olderog
FCT
2007
Springer
13 years 11 months ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
Thomas Colcombet
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 11 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
CADE
2008
Springer
14 years 7 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
COMPSAC
2009
IEEE
14 years 2 months ago
System Safety Requirements as Control Structures
Along with the popularity of software-intensive systems, the interactions between system components and between humans and software applications are becoming more and more complex...
Zhe Chen, Gilles Motet