scientific article; zbMATH DE number 1962855
From MaRDI portal
Publication:4418693
zbMATH Open1035.68063MaRDI QIDQ4418693FDOQ4418693
Authors: Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070687.htm
Title of this publication is not available (Why is that?)
Recommendations
Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cited In (12)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Decision problems for lower/upper bound parametric timed automata
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- An automata-theoretic approach to constraint LTL
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Reasoning about reversal-bounded counter machines
- Monotonic hybrid systems
- Model checking restricted sets of timed paths
- Durations and parametric model-checking in timed automata
- Title not available (Why is that?)
- Real-Time Model-Checking: Parameters everywhere
- Robust parametric reachability for timed automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418693)