scientific article; zbMATH DE number 2102690
From MaRDI portal
Publication:4817528
zbMath1046.68574MaRDI QIDQ4817528
Publication date: 24 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (32)
Presburger liveness verification of discrete timed automata. ⋮ Formal abstraction and synthesis of parametric stochastic processes ⋮ Liveness of Parameterized Timed Networks ⋮ Event Clock Automata: From Theory to Practice ⋮ From Safety Critical Java Programs to Timed Process Models ⋮ SetExp: a method of transformation of timed automata into finite state automata ⋮ Learning of event-recording automata ⋮ Aspects of availability. Enforcing timed properties to prevent denial of service ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ Human-cyber-physical automata and their synthesis ⋮ Verification in loosely synchronous queue-connected discrete timed automata. ⋮ Generalized discrete timed automata: Decidable approximations for safety verification. ⋮ Pushdown timed automata: A binary reachability characterization and safety verification. ⋮ SMT-based modeling and verification of spiking neural networks: a case study ⋮ SAT-based verification for timed component connectors ⋮ Past pushdown timed automata and safety verification. ⋮ Hybrid I/O automata. ⋮ On regions and zones for event-clock automata ⋮ Temporal constraints in the logical analysis of regulatory networks ⋮ Unnamed Item ⋮ Bio-Logics: Logical Analysis of Bioregulatory Networks ⋮ A menagerie of timed automata ⋮ A control synthesis approach for time discrete event systems ⋮ Unnamed Item ⋮ Timed automata relaxation for reachability ⋮ Network invariants for real-time systems ⋮ Checking Timed Büchi Automata Emptiness Using LU-Abstractions ⋮ Timed Semantics of Message Sequence Charts Based on Timed Automata ⋮ On composition and lookahead delegation of \(e\)-services modeled by automata ⋮ Verification of Linear Duration Invariants by Model Checking CTL Properties ⋮ Discretization of Timed Automata in Timed μCRL à la Regions and Zones ⋮ Towards Deriving Test Sequences by Model Checking
This page was built for publication:
