1012 search results - page 126 / 203 » Process Algebra with Backtracking |
ENTCS
2010
13 years 9 months ago
2010
The global states of complex systems often form pospaces, topological spaces equipped with compatible partial orders reflecting causal relationships between the states. The calcul...
ENTCS
2008
13 years 9 months ago
2008
There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalenc...
FUIN
2007
13 years 9 months ago
2007
We present in this paper the algorithm which performs the translation of MSC’2000 diagrams into Petri net modulo strong bisimulation. The correctness of this algorithm is justifi...
IJBC
2007
13 years 9 months ago
2007
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper motivates the need for a formalism for the modelling and analysis of dynamic reconfiguration of dependable real-time systems. We present requirements that the formalism ...