scientific article

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

concurrent systems decision problems timed Büchi automata closure properties qualitative temporal reasoning deterministic timed Muller automata finite-state asynchronous real- time systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Time abstracted bisimulation: Implicit specifications and decidability, Verification of Gap-Order Constraint Abstractions of Counter Systems, Continuity controlled hybrid automata, CTL* model checking for time Petri nets, Updatable timed automata, Removing ε-transitions in timed automata, A logic for reasoning about time and reliability, Computing with polynomial ordinary differential equations, An iterative approach to verification of real-time systems, A Proof-Based Method for Modelling Timed Systems, Protocol scheduling, Unnamed Item, Timed substitutions for regular signal-event languages, On using priced timed automata to achieve optimal scheduling, A brief account of runtime verification, Modeling Objects Moving in a Complex Environment with World Automata, Computation with perturbed dynamical systems, Consistent approximations of the Zeno behaviour in affine-type switched dynamic systems, An engineering process for the verification of real-time systems, Decidable hybrid systems, Timed automata and recognizability, Language Preservation Problems in Parametric Timed Automata, Symbolic timing devices, A process algebra of communicating shared resources with dense time and priorities, Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems, A survey of timed automata for the development of real-time systems, Validation and verification of web services choreographies by using timed automata, Concurrent weighted logic, Elimination of detached regions in dependency graph verification, Simulation relations and applications in formal methods, Controller synthesis for dynamic hierarchical real-time plants using timed automata, Equivalence checking 40 years after: a review of bisimulation tools, Symbolic state estimation in bounded timed labeled Petri nets, Verification of gap-order constraint abstractions of counter systems, Contracts for cross-organizational workflows as timed dynamic condition response graphs, Reachability analysis for timed automata using max-plus algebra, Nonblocking supervisory control of timed discrete event systems under communication delays: the existence conditions, Alternation-free weighted mu-calculus: decidability and completeness, Parametric Verification of Weighted Systems, Model-checking precision agriculture logistics: the case of the differential harvest, Zeno hybrid systems, Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets, TCTL-preserving translations from timed-arc Petri nets to networks of timed automata, Deciding properties of integral relational automata, On some relations between dynamical systems and transition systems, A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets, On the regularization of Zeno hybrid automata, Interval logics and their decision procedures. II: A real-time interval logic, WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model, Optimal reachability for multi-priced timed automata, Minimum and maximum delay problems in real-time systems, Specification and automatic verification of self-timed queues, Sooner is safer than later, Optimal infinite scheduling for multi-priced timed automata, Incremental methods for checking real-time consistency, Using mappings to prove timing properties, Complete proof systems for weighted modal logic, Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs, Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties, Compositional Design of Stochastic Timed Automata, A menagerie of timed automata, Reachability solution characterization of parametric real-time systems, Grid automata and supervisory control of dense real-time discrete event systems, Discount-Optimal Infinite Runs in Priced Timed Automata, Fuzzy regular languages over finite and infinite words, Quantitative analysis of weighted transition systems, Formal language properties of hybrid systems with strong resets, Process algebra for hybrid systems, Pentagons: a weakly relational abstract domain for the efficient validation of array accesses, A real-time interval logic and its decision procedure, Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, What good are digital clocks?, On-the-fly \(TCTL\) model checking for time Petri nets, On decidability of recursive weighted logics, Verification of Timed-Arc Petri Nets, Network invariants for real-time systems, An Introduction to Timed Automata, A method for the modular synthesis of controllers for timed discrete-event systems, Verifying automata specification of distributed probabilistic real-time systems, Model-checking Timed Temporal Logics, Formalized Timed Automata, Bounded model checking for knowledge and real time, Investigating the usability of real-time scheduling theory with the Cheddar project, Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks, Computational bounds on polynomial differential equations, Information system design of manufacturing environments, Contraction of the ITCPN state space, Exact Acceleration of Real-Time Model Checking, Interval Duration Logic, Theorem of abstraction for equivalent controllers in hybrid systems, Timed automata and additive clock constraints, On a class of timer hybrid systems reducible to finite state automata, The Verus language: Representing time efficiently with BDDs, A logical characterization of data languages., Automated verification of an audio-control protocol using UPPAAL, Linear parametric model checking of timed automata, Zone-based verification of timed automata: extrapolations, simulations and what next?, A Survey on Analog Models of Computation, Discussion on: ``Formal specification method for systems automation