CMC

swMATH12422MaRDI QIDQ24351FDOQ24351

Author name not available (Why is that?)

Cited In (31)

• 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
• Title not available (Why is that?)
• Decompositional Reasoning about the History of Parallel Processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Timed modal logics for real-time systems. Specification, verification and control
• 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
• Automatic Abstraction Refinement for Timed Automata
• Formal Modeling and Analysis of Timed Systems
• Updatable timed automata
• Is your model checker on time? On the complexity of model checking for timed modal logics
• Verification of Timed-Arc Petri Nets
• Partial model checking using networks of labelled transition systems and Boolean equation systems
• Title not available (Why is that?)
• The power of reachability testing for timed automata
• Title not available (Why is that?)
• Characteristic formulae for timed autoamta
• Compositional verification of asynchronous concurrent systems using CADP
• TCTL Inevitability Analysis of Dense-Time Systems
• Symbolic and Compositional Reachability for Timed Automata
• On characteristic formulae for event-recording automata
• A menagerie of timed automata
• Applications and Theory of Petri Nets 2005
• 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