ACM Transactions on Computer Systems (TOCS)
Information and Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Theoretical Computer Science
The PEPA workbench: a tool to support a process algebra-based approach to performance modelling
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Algebraic Reasoning for Real-Time Probabilistic Processes with Uncertain Information
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
An algebraic approach to the specification of stochastic systems
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
On Petri nets with deterministic and exponentially distributed firing times
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Formal verification of probabilistic systems
Formal verification of probabilistic systems
VESTA: A Statistical Model-checker and Analyzer for Probabilistic Systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
Formal Methods in System Design
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Theoretical Computer Science
PRISM: probabilistic model checking for performance and reliability analysis
ACM SIGMETRICS Performance Evaluation Review
Formal Modeling and Analysis of an IETF Multicast Protocol
SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
PVESTA: a parallel statistical model checking and quantitative analysis tool
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Hi-index | 0.00 |
Unbounded data structures, advanced data types, and/or different forms of communication are often needed to model large and complex probabilistic real-time systems such as wireless sensor networks. Furthermore, it is often natural to model such systems in an objectoriented style, using subclass inheritance and dynamic object and message creation and deletion. To support the above features, we introduce probabilistic real-time rewrite theories (PRTRTs), that extend both realtime rewrite theories and probabilistic rewrite theories, as a rewritinglogic-based formalism for probabilistic real-time systems. We then show that PRTRTs can be seen as a unifying model in which a range of other models for probabilistic real-time systems--including probabilistic timed automata, stochastic automata, deterministic and stochastic Petri nets, as well as two probabilistic timed transition system models with underspecified probability distributions--can naturally be represented.