Sciweavers

315 search results - page 6 / 63
» What is algebraic in process theory
Sort
View
BIRTHDAY
2000
Springer
13 years 11 months ago
Discrete time process algebra with silent step
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Renie...
SFM
2004
Springer
120views Formal Methods» more  SFM 2004»
14 years 1 days ago
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)
We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other va...
Jos C. M. Baeten, Michel A. Reniers
LICS
2002
IEEE
13 years 11 months ago
The Proof Complexity of Linear Algebra
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
Michael Soltys, Stephen A. Cook
BIRTHDAY
2005
Springer
14 years 7 days ago
Timing the Untimed: Terminating Successfully While Being Conservative
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A....
IJAC
2008
58views more  IJAC 2008»
13 years 6 months ago
Symplectic Alternating Algebras
This paper begins the development of a theory of what we will call symplectic alternating algebras. They have arisen in the study of 2-Engel groups but seem also to be of interest...
Gunnar Traustason