22 search results - page 4 / 5 » A Ground-Complete Axiomatization of Finite State Processes i... |
74
Voted
TCS
2008
14 years 9 months ago
2008
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
100
Voted
UML
2005
Springer
15 years 3 months ago
2005
Springer
We present in this paper a rigorous and automated based approach for the behavioral validation of control software systems. This approach relies on metamodeling, model-transformati...
120
click to vote
KR
2004
Springer
15 years 2 months ago
2004
Springer
We discuss the representation of knowledge and of belief from the viewpoint of decision theory. While the Bayesian approach enjoys general-purpose applicability and axiomatic foun...
MFCS
1991
Springer
15 years 1 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
84
Voted
IJCAI
1993
14 years 10 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...