Reachability in timed counter systems

DOI10.1016/J.ENTCS.2009.05.038MaRDI QIDQ5179060zbMATH OpenOpenAlexFDO

Authors Florent Bouchy, Arnaud Sangnier, Alain Finkel

Publication date 19 March 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.05.038

zbMATH Keywords

Petri netsreachabilityreversal-bounded counter systemstimed automatatimed counter systemsVASSverification

Mathematics Subject Classification ID

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

• On the relationship between reachability problems in timed and counter automata
• Relating reachability problems in timed and counter automata
• Decidability and complexity results for timed automata and semi-linear hybrid automta
• An undecidable problem for timed automata
• On parametric timed automata and one-counter machines

Cites work

• A theory of timed automata
• About \textsc{Fast} and \textsc{TReX} accelerations
• An Algorithm for the General Petri Net Reachability Problem
• Automated Technology for Verification and Analysis
• Binary reachability analysis of discrete pushdown timed automata
• Dense counter machines and verification problems.
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• How to compose Presburger-accelerations: Applications to broadcast protocols
• scientific article; zbMATH DE number 1337733 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Parallel program schemata
• Reversal-Bounded Counter Machines Revisited
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Symbolic techniques for parametric reasoning about counter and clock systems
• Timed automata and the theory of real numbers
• TREX: A tool for reachability analysis of complex systems
• Untiming timed languages

Cited in

(13)

• Timing conditions for linearizability in uniform counting networks
• On the determinization of timed systems
• Dense-choice counter machines revisited
• On reachability analysis of updatable timed automata with one updatable clock
• Relating reachability problems in timed and counter automata
• New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract)
• On the relationship between reachability problems in timed and counter automata
• Reachability of communicating timed processes
• scientific article; zbMATH DE number 7297846 (Why is no real title available?)
• Formal Modeling and Analysis of Timed Systems
• Optimal time-bounded reachability analysis for concurrent systems
• Linear reachability problems and minimal solutions to linear Diophantine equation systems
• Reachability results for timed automata with unbounded data structures

Describes a project that uses

Uses Software

• FAST
• TREX

This page was built for publication: Reachability in timed counter systems

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