Specification Theories for Probabilistic and Real-Time Systems

DOI10.1007/978-3-642-54848-2_7zbMath1416.68112OpenAlexW1828718242MaRDI QIDQ5170746

Louis-Marie Traonouez, Axel Legay, Uli Fahrenberg

Publication date: 24 July 2014

Published in: From Programs to Systems. The Systems perspective in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54848-2_7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Parametric and Quantitative Extensions of Modal Transition Systems

Uses Software

• z3
• PyEcdar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust synthesis for real-time systems
• Metrics for weighted transition systems: axiomatization and complexity
• Switched PIOA: parallel composition via distributed scheduling
• Analyzing security protocols using time-bounded task-PIOAs
• General Quantitative Specification Theories with Modalities
• Timed I/O automata
• Abstract Probabilistic Automata
• A testing scenario for probabilistic processes
• Parametric and Quantitative Extensions of Modal Transition Systems
• Parametric real-time reasoning
• A Probabilistic Extension of UML Statecharts
• Three-Valued Abstraction for Continuous-Time Markov Chains
• Probability and Nondeterminism in Operational Models of Concurrency
• CONCUR 2005 – Concurrency Theory
• Model Checking Software