scientific article; zbMATH DE number 7453961
From MaRDI portal
Publication:5020942
Angelo Ferrando, Davide Ancona, Viviana Mascardi
Publication date: 7 January 2022
Full work available at URL: https://arxiv.org/abs/2009.00391
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Uses Software
Cites Work
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Fundamental properties of infinite trees
- Comparing trace expressions and linear temporal logic for runtime verification
- A brief account of runtime verification
- Verifying data- and control-oriented properties combining static and runtime verification: theory and tools
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- On Global Types and Multi-Party Session
- Semantic subtyping
- Parametric Trace Slicing and Monitoring
- Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors
- Tools and Algorithms for the Construction and Analysis of Systems
