CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68057OpenAlexW2499482941MaRDI QIDQ5311487

No author found.

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

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (22)

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities ⋮ Efficient timed model checking for discrete-time systems ⋮ Concavely-Priced Probabilistic Timed Automata ⋮ When are stochastic transition systems tameable? ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ The tail-recursive fragment of timed recursive CTL ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ Energy Büchi problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Timed Basic Parallel Processes ⋮ Emptiness and Universality Problems in Timed Automata with Positive Frequency ⋮ Model checking temporal properties of reaction systems ⋮ On parametric timed automata and one-counter machines ⋮ Timed Petri nets and timed automata: On the discriminating power of Zeno sequences ⋮ The efficiency of identifying timed automata and the power of clocks ⋮ Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions ⋮ Reachability in two-clock timed automata is PSPACE-complete ⋮ Timed network games ⋮ Continuous One-counter Automata

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