CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113MaRDI QIDQ5311487zbMATH OpenOpenAlexFDO

Authors

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Model Checking One-clock Priced Timed Automata
• Model-Checking One-Clock Priced Timed Automata
• On model-checking timed automata with stopwatch observers
• Verified model checking of timed automata
• Branching-time model checking of one-counter processes and timed automata
• Bounded model checking for timed automata
• scientific article; zbMATH DE number 7559498
• Model Checking Metric Temporal Logic over Automata with One Counter

Cited in

(35)

• When are stochastic transition systems tameable?
• Model checking temporal properties of reaction systems
• Timed network games
• Reachability relations of timed pushdown automata
• Reachability in two-clock timed automata is PSPACE-complete
• Efficient timed model checking for discrete-time systems
• A survey on temporal logics for specifying and verifying real-time systems
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
• Branching-time model checking of one-counter processes and timed automata
• On clock-aware LTL properties of timed automata
• Emptiness and universality problems in timed automata with positive frequency
• Concavely-Priced Probabilistic Timed Automata
• Reducing clocks in timed automata while preserving bisimulation
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Model Checking Metric Temporal Logic over Automata with One Counter
• Timed network games with clocks
• Probabilistic timed automata with one clock and initialised clock-dependent probabilities
• Probabilistic timed automata with one clock and initialised clock-dependent probabilities
• On parametric timed automata and one-counter machines
• Reachability in two-clock timed automata is PSPACE-complete
• The efficiency of identifying timed automata and the power of clocks
• Model-Checking One-Clock Priced Timed Automata
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Timed Basic Parallel Processes
• Continuous One-counter Automata
• The tail-recursive fragment of timed recursive CTL
• Equivalence checking and intersection of deterministic timed finite state machines
• Energy Büchi problems
• Model checking timed recursive CTL
• -regular energy problems
• Decidability of one-clock weighted timed games with arbitrary weights
• The bright side of timed opacity

This page was built for publication: CONCUR 2004 - Concurrency Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311487)