Sciweavers

4485 search results - page 12 / 897
» Equivalences on Observable Processes
Sort
View
ENTCS
1998
115views more  ENTCS 1998»
13 years 8 months ago
A Testing Equivalence for Reactive Probabilistic Processes
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...
Marta Z. Kwiatkowska, Gethin Norman
ICALP
1998
Springer
14 years 24 days ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
PARLE
1987
14 years 2 days ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
ICSOC
2007
Springer
14 years 2 months ago
Goal-Equivalent Secure Business Process Re-engineering
Hugo A. López, Fabio Massacci, Nicola Zanno...