CMC
From MaRDI portal
Cited in
(54)- A survey of timed automata for the development of real-time systems
- Natural projection as partial model checking
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- scientific article; zbMATH DE number 1670789 (Why is no real title available?)
- Timed modal logics for real-time systems. Specification, verification and control
- scientific article; zbMATH DE number 1956577 (Why is no real title available?)
- scientific article; zbMATH DE number 2080038 (Why is no real title available?)
- The Power of Proofs: New Algorithms for Timed Automata Model Checking
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Timed Control with Observation Based and Stuttering Invariant Strategies
- TCTL inevitability analysis of dense-time systems
- Automatic Abstraction Refinement for Timed Automata
- Symbolic and compositional reachability for timed automata
- Updatable timed automata
- Is your model checker on time? On the complexity of model checking for timed modal logics
- Formal Modeling and Analysis of Timed Systems
- Verification of Timed-Arc Petri Nets
- Romeo
- TAPAAL
- Kronos
- IF-2.0
- TINA
- PetriNets
- Uppaal
- DREAM Tool
- Exp.Open
- McAiT
- CAESAR_SOLVE
- CoVer
- Tempo
- fc2tools
- Synthia
- UPPAAL TIGA
- TCT
- libFAUDES
- LNT2LOTOS
- REDLIB
- UPPAAL CORA
- MuDiv
- PESTS
- Partial model checking using networks of labelled transition systems and Boolean equation systems
- scientific article; zbMATH DE number 2080037 (Why is no real title available?)
- The power of reachability testing for timed automata
- scientific article; zbMATH DE number 1956585 (Why is no real title available?)
- Characteristic formulae for timed autoamta
- Compositional verification of asynchronous concurrent systems using CADP
- On characteristic formulae for event-recording automata
- A menagerie of timed automata
- Applications and Theory of Petri Nets 2005
- Decompositional reasoning about the history of parallel processes
- Efficient On-the-Fly Algorithms for Partially Observable Timed Games
- Logical characterisations, rule formats and compositionality for input-output conformance simulation
- Structural translation from time Petri nets to timed automata
- Symbolic Unfoldings for Networks of Timed Automata
This page was built for software: CMC
