Probabilistic Real-Time Rewrite Theories and Their Expressive Power
From MaRDI portal
Publication:3172843
DOI10.1007/978-3-642-24310-3_6zbMATH Open1348.68080OpenAlexW1495622653MaRDI QIDQ3172843FDOQ3172843
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
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Grammars and rewriting systems (68Q42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- A theory of timed automata
- Specification of real-time and hybrid systems in rewriting logic
- Automatic verification of real-time systems with discrete probability distributions.
- Conditional rewriting logic as a unified model of concurrency
- Semantic foundations for generalized rewrite theories
- Semantics and pragmatics of real-time maude
- Petri nets are monoids
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
- Validation of Stochastic Systems
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
- Probabilistic Real-Time Rewrite Theories and Their Expressive Power
Cited In (1)
Uses Software
This page was built for publication: Probabilistic Real-Time Rewrite Theories and Their Expressive Power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172843)
