Sciweavers

55 search results - page 1 / 11
» Pomset Languages of Finite Step Transition Systems
Sort
View
ENTCS
2006
273views more  ENTCS 2006»
13 years 5 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
ICDCS
1993
IEEE
13 years 9 months ago
Diagnosis of Single Transition Faults in Communicating Finite State Machines
In this paper, we propose a diagnostic algorithm for the case where distributed system specifications (implementations) are given in the form of communicating finite state machine...
Abderrazak Ghedamsi, Gregor von Bochmann, Rachida ...
CAI
2005
Springer
13 years 5 months ago
Behavioural Equivalences on Finite-State Systems are PTIME-hard
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e.,...
Zdenek Sawa, Petr Jancar
PTS
2003
108views Hardware» more  PTS 2003»
13 years 6 months ago
Fault Diagnosis in Extended Finite State Machines
In this paper, we propose a method for the derivation of an adaptive diagnostic test suite when the system specification and implementation are given in the form of an extended fin...
Khaled El-Fakih, Svetlana Prokopenko, Nina Yevtush...