Characterization of Load Uncertainty in Unstructured Terrains and Applications to Battery Remaining Run-time Prediction

2013 ◽  
Vol 30 (3) ◽  
pp. 472-487 ◽  
Author(s):  
Jonathan R. LeSage ◽  
Raul G. Longoria
Keyword(s):  
Load Uncertainty ◽  
Time Prediction ◽  
Run Time

Mining usage scenarios in business processes: Outlier-aware discovery and run-time prediction

2011 ◽  
Vol 70 (12) ◽  
pp. 1005-1029 ◽  
Author(s):  
Francesco Folino ◽  
Gianluigi Greco ◽  
Antonella Guzzo ◽  
Luigi Pontieri
Keyword(s):  
Business Processes ◽  
Time Prediction ◽  
Run Time

Run-Time Prediction Practices of Multimedia Web Design in Technology Management

2021 ◽  
pp. 179-186
Author(s):  
Bin Hu ◽  
Sohail M. Noman ◽  
Muhammad Irshad ◽  
Xilang Tang ◽  
Chen Song ◽  
...  
Keyword(s):  
Technology Management ◽  
Web Design ◽  
Time Prediction ◽  
Run Time

scholarly journals Dynamic Congruence vs. Progressing Bisimulation for CCS1

1992 ◽  
Vol 16 (2) ◽  
pp. 171-199
Author(s):  
Ugo Montanari ◽  
Vladimiro Sassone
Keyword(s):  
Modal Logic ◽  
Concurrent Systems ◽  
Universal Property ◽  
Algebraic Characterization ◽  
Semantic Function ◽  
Complete Axiomatization ◽  
Natural Notion ◽  
Run Time

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 woc, e.g. α.τ.β.nil and α.β.nil are woc but τ.β.nil and β.nil are not. This fact prevent us from characterizing CCS semantics (when τ is considered invisible) as a final algebra, since the semantic function would induce an equivalence over the agents that is both a congruence and a bisimulation. In the paper we introduce a new behavioural equivalence for CCS agents, which is the coarsest among those bisimulations which are also congruences. We call it Dynamic Observational Congruence because it expresses a natural notion of equivalence for concurrent systems required to simulate each other in the presence of dynamic, i.e. run time, (re)configurations. We provide an algebraic characterization of Dynamic Congruence in terms of a universal property of finality. Furthermore we introduce Progressing Bisimulation, which forces processes to simulate each other performing explicit steps. We provide an algebraic characterization of it in terms of finality, two logical characterizations via modal logic in the style of HML and a complete axiomatization for finite agents (consisting of the axioms for Strong Observational Congruence and of two of the three Milner’s τ-laws). Finally, we prove that Dynamic Congruence and Progressing Bisimulation coincide for CCS agents.

Sign in / Sign up

Export Citation Format

Share Document