Representing and reasoning with probabilistic knowledge: a logical approach to probabilities
Representing and reasoning with probabilistic knowledge: a logical approach to probabilities
Stochastic Automata Network of Modeling Parallel Systems
IEEE Transactions on Software Engineering
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Decidability and expressiveness for first-order logics of probability
Information and Computation
Term rewriting and all that
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Introducation to stochastic Petri nets
Lectures on formal methods and performance analysis
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method
Proceedings of the 7th Colloquium on Automata, Languages and Programming
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Probabilistic Rewrite Strategies. Applications to ELAN
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
An Operational Semantics for Probabilistic Concurrent Constraint Programming
ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
An Abstract Way to Define Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Attenuation regulation as a term rewriting system
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Proving positive almost-sure termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic.