Probabilistic Real-Time Rewrite Theories and Their Expressive Power

DOI10.1007/978-3-642-24310-3_6zbMath1348.68080OpenAlexW1495622653MaRDI QIDQ3172843

Lucian Bentea, Peter Csaba Ölveczky

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10852/39285

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Probabilistic Real-Time Rewrite Theories and Their Expressive Power

Uses Software

• Maude
• PVeStA
• VESTA
• PEPA

Cites Work

• Unnamed Item
• Unnamed Item
• Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
• Semantics and pragmatics of real-time maude
• Petri nets are monoids
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
• Conditional rewriting logic as a unified model of concurrency
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Specification of real-time and hybrid systems in rewriting logic
• Semantic foundations for generalized rewrite theories
• Probabilistic Real-Time Rewrite Theories and Their Expressive Power
• Validation of Stochastic Systems

This page was built for publication: Probabilistic Real-Time Rewrite Theories and Their Expressive Power