On the public citation graph
The tool Kronos
0 signed · 395 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferredcites →https://doi.org/10.1006/inco.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1007/3-540-54430-5_78openalex-snapshot
A tool set for deciding behavioral equivalences
inferredcites →https://doi.org/10.1007/3-540-61474-5_72openalex-snapshot
Analysis of timed systems based on time-abstracting bisimulations
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_17openalex-snapshot
Verifying ET-LOTOS programs with KRONOS
inferredcites →https://doi.org/10.1007/bfb0031985openalex-snapshot
An old-fashioned recipe for real time
inferredcites →https://doi.org/10.1016/0167-6423(92)90018-7openalex-snapshot
Minimal state graph generation
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1109/real.1992.242667openalex-snapshot
An implementation of three algorithms for timing verification based on automata emptiness
inferredcites →https://doi.org/10.1109/real.1995.495197openalex-snapshot
Two examples of verification of multirate timed automata with Kronos
inferredcites →https://doi.org/10.1109/real.1995.495198openalex-snapshot
Compositional and symbolic model-checking of real-time systems
inferredcites →https://doi.org/10.1145/186025.186058openalex-snapshot
An old-fashioned recipe for real time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118602638.ch9openalex-snapshot
Verification of Timed Systems
inferred← citeshttps://doi.org/10.1006/jsco.2001.0472openalex-snapshot
Symbolic Reachability Computation for Families of Linear Vector Fields
inferred← citeshttps://doi.org/10.1007/0-306-47003-9_15openalex-snapshot
Symbolic Verification of Complex Real-time Systems with Clock-restriction Diagram
inferred← citeshttps://doi.org/10.1007/0-306-47003-9_22openalex-snapshot
Verification of Dense Time Properties Using Theories of Untimed Process Algebra
inferred← citeshttps://doi.org/10.1007/0-306-47003-9_8openalex-snapshot
Time and Action Lock Freedom Properties for Timed Automata
inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_21openalex-snapshot
An Introduction to Hybrid Automata
inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_22openalex-snapshot
An Overview of Hybrid Systems Control
inferred← citeshttps://doi.org/10.1007/10692867_13openalex-snapshot
Abstraction and Modular Verification of Infinite-State Reactive Systems
inferred← citeshttps://doi.org/10.1007/10722167_32openalex-snapshot
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
inferred← citeshttps://doi.org/10.1007/11430230_13openalex-snapshot
State Identification Problems for Timed Automata
inferred← citeshttps://doi.org/10.1007/11430230_15openalex-snapshot
An Expressive and Implementable Formal Framework for Testing Real-Time Systems
inferred← citeshttps://doi.org/10.1007/11533962_14openalex-snapshot
Integrated Tool for Testing Timed Systems
inferred← citeshttps://doi.org/10.1007/11539452_12openalex-snapshot
A New Modality for Almost Everywhere Properties in Timed Automata
inferred← citeshttps://doi.org/10.1007/11558958_59openalex-snapshot
A Model Analysis of a Distributed Monitoring System Using a Multi-formalism Approach
inferred← citeshttps://doi.org/10.1007/11560647_18openalex-snapshot
Symbolic Model Checking of Finite Precision Timed Automata
inferred← citeshttps://doi.org/10.1007/11562436_8openalex-snapshot
Fast Generic Model-Checking for Data-Based Systems
inferred← citeshttps://doi.org/10.1007/11603009_10openalex-snapshot
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
inferred← citeshttps://doi.org/10.1007/11603009_21openalex-snapshot
Implementation of Timed Automata: An Issue of Semantics or Modeling?
inferred← citeshttps://doi.org/10.1007/11867340_11openalex-snapshot
Symbolic Robustness Analysis of Timed Automata
inferred← citeshttps://doi.org/10.1007/11901433_13openalex-snapshot
Verification of Computation Orchestration Via Timed Automata
inferred← citeshttps://doi.org/10.1007/11955757_13openalex-snapshot
Time Constraint Patterns for Event B Development
inferred← citeshttps://doi.org/10.1007/3-540-36137-5_1openalex-snapshot
Conformance Testing Techniques for Timed Systems
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_10openalex-snapshot
Abstract Interpretation Based Formal Methods and Future Challenges
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_39openalex-snapshot
TAXYS: A Tool for the Development and Verification of Real-Time Embedded Systems?
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_66openalex-snapshot
On the Representation of Timed Polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_17openalex-snapshot
TCTL Inevitability Analysis of Dense-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_26openalex-snapshot
Modeling Real-Time Systems — Challenges and Work Directions
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_24openalex-snapshot
Partial Order Path Technique for Checking Parallel Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_8openalex-snapshot
Scheduler Modeling Based on the Controller Synthesis Paradigm
inferred← citeshttps://doi.org/10.1007/3-540-45828-x_19openalex-snapshot
A Protocol for Loosely Time-Triggered Architectures
inferred← citeshttps://doi.org/10.1007/3-540-45873-5_19openalex-snapshot
Exploiting Implicit Representations in Timed Automaton Verification for Controller Synthesis
inferred← citeshttps://doi.org/10.1007/3-540-45873-5_6openalex-snapshot
Reachability Analysis of Hybrid Systems via Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_3openalex-snapshot
Improving the Verification of Timed Systems Using Influence Information
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_4openalex-snapshot
Digitisation and Full Abstraction for Dense-Time Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_10openalex-snapshot
On Memory-Block Traversal Problems in Model-Checking Timed Systems
inferred← citeshttps://doi.org/10.1007/3-540-46430-1_27openalex-snapshot
Level Set Methods for Computation in Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-46430-1_6openalex-snapshot
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
inferred← citeshttps://doi.org/10.1007/3-540-48057-9_13openalex-snapshot
Proving Sequential Function Chart Programs Using Automata
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_15openalex-snapshot
Correct Real-Time Software for Programmable Logic Controllers
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_13openalex-snapshot
The UniForM workbench a universal development environment for formal methods
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_14openalex-snapshot
Formal Modeling and Analysis of Hybrid Systems: A Case Study in Multi-robot Coordination
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_15openalex-snapshot
On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_11openalex-snapshot
Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics
inferred← citeshttps://doi.org/10.1007/3-540-48166-4_30openalex-snapshot
Verification of Real-Time Designs: Combining Scheduling Theory with Automatic Formal Verification
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_4openalex-snapshot
Polyhedral Analysis for Synchronous Languages
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_11openalex-snapshot
Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_1openalex-snapshot
Design, Simulation, and Implementation of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_17openalex-snapshot
Formal Verification of a Power Controller Using the Real-Time Model Checker Uppaal
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_20openalex-snapshot
Modelling Timeouts without Timelocks
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_5openalex-snapshot
Timed Diagnostics for Reachability Properties
inferred← citeshttps://doi.org/10.1007/3-540-49163-5_3openalex-snapshot
On Hybrid Systems and the Modal µ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_72openalex-snapshot
Analysis of timed systems based on time-abstracting bisimulations
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_11openalex-snapshot
A visual formalism for real time requirement specifications
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_3openalex-snapshot
Deductive verification of real-time systems using STeP
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_6openalex-snapshot
Modularity for timed and hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_18openalex-snapshot
An improved reachability analysis method for strongly linear hybrid systems (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_19openalex-snapshot
Some progress in the symbolic verification of timed automata
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_48openalex-snapshot
HyTech: A model checker for hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-64358-3_28openalex-snapshot
Equations on timed languages
inferred← citeshttps://doi.org/10.1007/978-0-387-35064-6_14openalex-snapshot
Algebra of Communicating Timing Charts for Describing and Verifying Hardware Interfaces
inferred← citeshttps://doi.org/10.1007/978-1-4471-0853-5_8openalex-snapshot
Hybrid Systems: Modeling and Supervisory Control
inferred← citeshttps://doi.org/10.1007/978-3-030-00151-3_13openalex-snapshot
Online Timed Pattern Matching Using Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_23openalex-snapshot
Mixed Semantics Guided Layered Bounded Reachability Analysis of Compositional Linear Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_13openalex-snapshot
Equivalence Checking 40 Years After: A Review of Bisimulation Tools
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_14openalex-snapshot
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
inferred← citeshttps://doi.org/10.1007/978-3-031-90900-9_10openalex-snapshot
Stochastic Timed Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_3openalex-snapshot
Modeling for Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-61470-0_10openalex-snapshot
Probabilistic Timed Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-65151-4_33openalex-snapshot
A Comparative Assessment of Collaborative Business Process Verification Approaches
inferred← citeshttps://doi.org/10.1007/978-3-319-65765-3_14openalex-snapshot
Let’s Be Lazy, We Have Time
inferred← citeshttps://doi.org/10.1007/978-3-540-24686-2_16openalex-snapshot
OVL Assertion-Checking of Embedded Software with Dense-Time Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-24686-2_37openalex-snapshot
Symbolic Simulation of Real-Time Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_10openalex-snapshot
Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_39openalex-snapshot
ObsSlice: A Timed Automata Slicer Based on Observers
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_1openalex-snapshot
Decision Problems for Timed Automata: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_21openalex-snapshot
Symbolic Model Checking for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30482-1_39openalex-snapshot
Timed Patterns: TCOZ to Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_2openalex-snapshot
Operational Semantics of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39884-4_17openalex-snapshot
Testing Protocol Robustness
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_28openalex-snapshot
On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_4openalex-snapshot
Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_44openalex-snapshot
Updatable Timed Automata with Additive and Diagonal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_6openalex-snapshot
Model Checking: From Tools to Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_30openalex-snapshot
Timed Concurrent Game Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_5openalex-snapshot
On Timed Models of Gene Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-75698-9_5openalex-snapshot
Is Your Security Protocol on Time ?
inferred← citeshttps://doi.org/10.1007/978-3-540-77419-8_7openalex-snapshot
Deep Random Search for Efficient Model Checking of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-78929-1_41openalex-snapshot
Composition of Motion Description Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-79707-4_6openalex-snapshot
Introducing Time in an Industrial Application of Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-87785-1_34openalex-snapshot
From Model Driven Engineering to Verification Driven Engineering
inferred← citeshttps://doi.org/10.1007/978-3-540-88479-8_19openalex-snapshot
A Partial Order Reduction Technique for Parallel Timed Automaton Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-02351-4_7openalex-snapshot
Timed Simulation of Extended AADL-Based Architecture Specifications with Timed Abstract State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_17openalex-snapshot
Stochastic Games for Verification of Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_38openalex-snapshot
Specifying and Verifying Business Processes Using PPML
inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_1openalex-snapshot
Performance Evaluation of Schedulers in a Probabilistic Setting
inferred← citeshttps://doi.org/10.1007/978-3-642-26010-0_13openalex-snapshot
Formal Verification of DEV&DESS Formalism Using Symbolic Model Checker HyTech
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_27openalex-snapshot
As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_12openalex-snapshot
The Unmet Challenge of Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_13openalex-snapshot
The Theory of Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_17openalex-snapshot
The SHIFT Programming Language and Run-time System for Dynamic Networks of Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_18openalex-snapshot
The Teja System for Real-Time Dynamic Event Management
inferred← citeshttps://doi.org/10.1007/978-3-662-68191-6_10openalex-snapshot
An Efficient State Space Construction for a Class of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-7091-3693-5_17openalex-snapshot
Specification and Verification of Media Constraints using UPPAAL
inferred← citeshttps://doi.org/10.1007/bf03037429openalex-snapshot
A LOTOS based tutorial on formal methods for object-oriented distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0028778openalex-snapshot
Optikron: A tool suite for enhancing model-checking of real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0028779openalex-snapshot
Kronos: A model-checking tool for real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0035403openalex-snapshot
The bounded retransmission protocol must be on time!
inferred← citeshttps://doi.org/10.1007/bfb0053601openalex-snapshot
Moby/plc — A design tool for hierarchical real-time automata
inferred← citeshttps://doi.org/10.1007/bfb0054178openalex-snapshot
Formal design and analysis of a gear controller
inferred← citeshttps://doi.org/10.1007/bfb0054180openalex-snapshot
Model checking of real-time reachability properties using abstractions
inferred← citeshttps://doi.org/10.1007/bfb0055334openalex-snapshot
Operational and logical semantics for polling real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0055349openalex-snapshot
Dynamical properties of timed automata
inferred← citeshttps://doi.org/10.1007/bfb0055351openalex-snapshot
On checking parallel real-time systems for linear duration properties
inferred← citeshttps://doi.org/10.1007/bfb0055357openalex-snapshot
Kronos: A model-checking tool for real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0055360openalex-snapshot
Moby/PLC — Graphical development of PLC-automata
inferred← citeshttps://doi.org/10.1007/bfb0055642openalex-snapshot
On discretization of delays in timed automata and digital circuits
inferred← citeshttps://doi.org/10.1007/bfb0055643openalex-snapshot
Partial order reductions for timed systems
inferred← citeshttps://doi.org/10.1007/s00165-004-0034-9openalex-snapshot
Comparing model checking and logical reasoning for real-time systems
inferred← citeshttps://doi.org/10.1007/s00165-007-0050-7openalex-snapshot
Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties
inferred← citeshttps://doi.org/10.1007/s001650050015openalex-snapshot
A Formal Definition of Time in LOTOS
inferred← citeshttps://doi.org/10.1007/s001650050032openalex-snapshot
Automatic Verification of a Lip-Synchronisation Protocol Using Uppaal
inferred← citeshttps://doi.org/10.1007/s001650300007openalex-snapshot
Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol
inferred← citeshttps://doi.org/10.1007/s00224-010-9253-zopenalex-snapshot
Model Checking Weighted Integer Reset Timed Automata
inferred← citeshttps://doi.org/10.1007/s10009-003-0118-5openalex-snapshot
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM
inferred← citeshttps://doi.org/10.1007/s10009-003-0135-4openalex-snapshot
Efficient verification of timed automata with BDD-like data structures
inferred← citeshttps://doi.org/10.1007/s10009-004-0143-zopenalex-snapshot
Issues in distributed timed model checking
inferred← citeshttps://doi.org/10.1007/s10009-007-0040-3openalex-snapshot
Improving state class constructions for CTL* model checking of time Petri nets
inferred← citeshttps://doi.org/10.1007/s10009-010-0135-0openalex-snapshot
Data decision diagrams for Promela systems analysis
inferred← citeshttps://doi.org/10.1007/s10009-010-0156-8openalex-snapshot
Oris: a tool for modeling, verification and evaluation of real-time systems
inferred← citeshttps://doi.org/10.1007/s10009-013-0284-zopenalex-snapshot
A loop acceleration technique to speed up verification of automatically generated plans
inferred← citeshttps://doi.org/10.1007/s10009-020-00585-wopenalex-snapshot
Formal testing of timed graph transformation systems using metric temporal graph logic
inferred← citeshttps://doi.org/10.1007/s100090050006openalex-snapshot
Continuous modeling of real-time and hybrid systems: from concepts to tools
inferred← citeshttps://doi.org/10.1007/s100090050007openalex-snapshot
Real-time system = discrete system + clock variables
inferred← citeshttps://doi.org/10.1007/s100090050008openalex-snapshot
HYTECH: a model checker for hybrid systems
inferred← citeshttps://doi.org/10.1007/s100090050009openalex-snapshot
KRONOS: a verification tool for real-time systems
inferred← citeshttps://doi.org/10.1007/s100090100048openalex-snapshot
Formal design and analysis of a gear controller
inferred← citeshttps://doi.org/10.1007/s10270-003-0050-xopenalex-snapshot
Automated formal verification of visual modeling languages by model checking
inferred← citeshttps://doi.org/10.1007/s10703-005-1632-8openalex-snapshot
Checking Timed Büchi Automata Emptiness Efficiently
inferred← citeshttps://doi.org/10.1007/s10703-009-0065-1openalex-snapshot
Conformance testing for real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-006-6883-yopenalex-snapshot
Verifying distributed real-time properties of embedded systems via graph transformations and model checking
inferred← citeshttps://doi.org/10.1007/s11241-007-9036-zopenalex-snapshot
Formal verification of multitasking applications based on timed automata model
inferred← citeshttps://doi.org/10.1007/s11241-017-9271-xopenalex-snapshot
Bounded determinization of timed automata with silent transitions
inferred← citeshttps://doi.org/10.1007/s11390-006-0041-9openalex-snapshot
Remove Irrelevant Atomic Formulas for Timed Automaton Model Checking
inferred← citeshttps://doi.org/10.1016/b978-044482816-3/50032-0openalex-snapshot
ObjectInterconnecting the GEODE and CÆSAR-Aldébaran toolsets
inferred← citeshttps://doi.org/10.1016/j.automatica.2004.01.012openalex-snapshot
On reachability and minimum cost optimal control
inferred← citeshttps://doi.org/10.1016/j.compag.2008.02.008openalex-snapshot
Using timed automata and model-checking to simulate material flow in agricultural production systems—Application to animal waste management
inferred← citeshttps://doi.org/10.1016/j.compind.2009.09.004openalex-snapshot
NCES-based modelling and CTL-based verification of reconfigurable embedded control systems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2013.05.001openalex-snapshot
A survey of timed automata for the development of real-time systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.009openalex-snapshot
Specification and Verification of Protocols With Time Constraints
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.10.015openalex-snapshot
On-the-fly Workload Prediction and Redistribution in the Distributed Timed Model Checker Zeus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.012openalex-snapshot
Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.027openalex-snapshot
Incremental Verification for On-the-Fly Controller Synthesis
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.035openalex-snapshot
Towards the Semantics and Verification of BPEL4WS
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.093openalex-snapshot
Timed CSP: A Retrospective
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.002openalex-snapshot
Weighted Timed Automata: Model-Checking and Games
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.007openalex-snapshot
Hybrid Automata in Systems Biology: How Far Can We Go?
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.044openalex-snapshot
Model-checking Timed Temporal Logics
inferred← citeshttps://doi.org/10.1016/j.ic.2007.01.004openalex-snapshot
Symbolic model checking for probabilistic timed automata
inferred← citeshttps://doi.org/10.1016/j.infsof.2017.07.014openalex-snapshot
Formal verification of ECML hybrid models with spaceex
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.05.027openalex-snapshot
A quadratic-time DBM-based successor algorithm for checking timed automata
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.09.003openalex-snapshot
Probabilistic timed graph transformation systems
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.10.005openalex-snapshot
Syntax and consistent equation semantics of hybrid Chi
inferred← citeshttps://doi.org/10.1016/j.jss.2008.04.035openalex-snapshot
Timed Behavior Trees for Failure Mode and Effects Analysis of time-critical systems
inferred← citeshttps://doi.org/10.1016/j.jss.2009.04.042openalex-snapshot
Case study on distributed and fault tolerant system modeling based on timed automata
inferred← citeshttps://doi.org/10.1016/j.jss.2017.06.060openalex-snapshot
Predictive runtime verification of timed properties
inferred← citeshttps://doi.org/10.1016/j.micpro.2005.07.001openalex-snapshot
Flowpaths: Compiling stack-based IR to hardware
inferred← citeshttps://doi.org/10.1016/j.procs.2016.04.203openalex-snapshot
From OWL-S to Timed Automata Network: Operational Semantic
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103314openalex-snapshot
A provably safe controller for the needle-steering problem using online strategy synthesis
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.026openalex-snapshot
Counterexample-guided predicate abstraction of hybrid systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.015openalex-snapshot
Hybrid automata, reachability, and Systems Biology
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.019openalex-snapshot
Detecting synchronisation of biological oscillators by model checking
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.005openalex-snapshot
Parameter synthesis for probabilistic timed automata using stochastic game abstractions
inferred← citeshttps://doi.org/10.1016/s0096-0551(01)00016-9openalex-snapshot
Argos: an automaton-based synchronous language
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00088-8openalex-snapshot
Deductive verification of real-time systems using STeP
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00089-xopenalex-snapshot
PLC-automata: a new class of implementable real-time automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00301-7openalex-snapshot
Proving sequential function chart programs using timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00046-9openalex-snapshot
Automatic verification of real-time systems with discrete probability distributions
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00173-4openalex-snapshot
Event-clock automata: a determinizable class of timed automata
inferred← citeshttps://doi.org/10.1016/s0947-3580(05)71047-5openalex-snapshot
Hybrid Control of Networked Embedded Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30789-9openalex-snapshot
Towards optimal CTL* model checking of time petri nets
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39950-0openalex-snapshot
A Tool for Modular Modelling and Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00023-1openalex-snapshot
Symbolic model checking of timed guarded commands using difference decision diagrams
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00226-9openalex-snapshot
Extending Timed Automata for Compositional Modeling Healthy Timed Systems
showing the first 200 of 382 · page through all 382
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.