The following pages link to Ruggero Lanotte (Q606995):
Displayed 46 items.
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Design and verification of long-running transactions in a timed framework (Q955710) (← links)
- \(\varepsilon\)-transitions in concurrent timed automata (Q1029035) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- Weak bisimulation metrics in models with nondeterminism and continuous state spaces (Q1623141) (← links)
- A semantic theory of the Internet of things (Q1706144) (← links)
- Concurrency in timed automata (Q1884910) (← links)
- A study on shuffle, stopwatches and independently evolving clocks (Q1938360) (← links)
- A probabilistic calculus of cyber-physical systems (Q2042728) (← links)
- A process calculus approach to detection and mitigation of PLC malware (Q2235740) (← links)
- Taylor approximation for hybrid systems (Q2461793) (← links)
- Monotonic hybrid systems (Q2486564) (← links)
- (Q2775864) (← links)
- Formal Models of Timing Attacks on Web Privacy (Q2841280) (← links)
- (Q2847407) (← links)
- (Q2849849) (← links)
- Probabilistic bisimulation as a congruence (Q2946567) (← links)
- A Function Elimination Method for Checking Satisfiability of Arithmetical Logics (Q2968852) (← links)
- Hybrid and First-Order Complete Extensions of CaRet (Q3010360) (← links)
- Semantic Analysis of Gossip Protocols for Wireless Sensor Networks (Q3090828) (← links)
- A Decidable Probability Logic for Timed Probabilistic Systems (Q3400533) (← links)
- (Q3517258) (← links)
- Distributed Time-Asynchronous Automata (Q3525084) (← links)
- Complexity and Succinctness Issues for Linear-Time Hybrid Logics (Q3532457) (← links)
- Removing All Silent Transitions from Timed Automata (Q3648827) (← links)
- (Q4461959) (← links)
- (Q4507819) (← links)
- (Q4536387) (← links)
- (Q4553277) (← links)
- (Q4782713) (← links)
- Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata (Q4989486) (← links)
- Weak Simulation Quasimetric in a Gossip Scenario (Q5082194) (← links)
- (Q5111289) (← links)
- Security Policies Enforcement Using Finite Edit Automata (Q5166611) (← links)
- On the decidability of linear bounded periodic cyber-physical systems (Q5239223) (← links)
- A Specification Format for Rooted Branching Bisimulation (Q5259297) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311127) (← links)
- Information and Communications Security (Q5464793) (← links)
- Hybrid Systems: Computation and Control (Q5703940) (← links)
- Foundations of Software Science and Computational Structures (Q5705909) (← links)
- A Calculus of Cyber-Physical Systems (Q5738991) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)
- Quantitative Robustness Analysis of Sensor Attacks on Cyber-Physical Systems (Q6202106) (← links)