The following pages link to IF-2.0 (Q15835):
Displaying 36 items.
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- Efficient verification of distributed real-time systems with broadcasting behaviors (Q656082) (← links)
- Translating Java for multiple model checkers: The Bandera back-end (Q816196) (← links)
- Verifying distributed real-time properties of embedded systems via graph transformations and model checking (Q853626) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Detecting synchronisation of biological oscillators by model checking (Q969176) (← links)
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude (Q1004068) (← links)
- Bounded determinization of timed automata with silent transitions (Q1699228) (← links)
- Model-checking timed automata with deadlines with Uppaal (Q1941900) (← links)
- Scaling up livelock verification for network-on-chip routing algorithms (Q2152663) (← links)
- Scheduling with timed automata (Q2368955) (← links)
- Schedulability of asynchronous real-time concurrent objects (Q2390036) (← links)
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata (Q2453531) (← links)
- Dynamic and formal verification of embedded systems: A comparative survey (Q2506271) (← links)
- Recent Advances in Real-Time Maude (Q2864519) (← links)
- Language-Oriented Formal Analysis: a Case Study on Protocols and Distributed Systems (Q2870335) (← links)
- Verification of Timed-Arc Petri Nets (Q3075507) (← links)
- Performance Evaluation of Schedulers in a Probabilistic Setting (Q3172839) (← links)
- Approximating Continuous Systems by Timed Automata (Q3506869) (← links)
- The Implementation of Mazurkiewicz Traces in POEM (Q3522932) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- Process Algebra for Parallel and Distributed Processing (Q3545001) (← links)
- SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (Q3557090) (← links)
- Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting (Q3588083) (← links)
- Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format (Q3605462) (← links)
- A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata (Q3648831) (← links)
- (Q4422085) (← links)
- (Q4450962) (← links)
- The Unmet Challenge of Timed Systems (Q5170750) (← links)
- Model Checking Software (Q5308370) (← links)
- Model Checking Software (Q5308384) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5717495) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5717502) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897479) (← links)
