On the public citation graph
Automata for modeling real-time systems
0 signed · 814 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.1007/3-540-16761-7_81openalex-snapshot
A timed model for communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-51803-7_28openalex-snapshot
Specifying message passing systems requires extending temporal logic
inferredcites →https://doi.org/10.1007/3-540-52148-8_17openalex-snapshot
Timing assumptions and verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1007/3-540-52590-4_43openalex-snapshot
A unified approach for showing language containment and equivalence between various types of ω-automata
inferredcites →https://doi.org/10.1007/3-540-54233-7_128openalex-snapshot
Model-checking for probabilistic real-time systems
inferredcites →https://doi.org/10.1007/3-540-56283-4openalex-snapshot
Specifying Message Passing and Time-Critical Systems with Temporal Logic
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bfb0015772openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0022-0000(74)80051-6openalex-snapshot
Theories of automata on ω-tapes: A simplified approach
inferredcites →https://doi.org/10.1109/lics.1990.113764openalex-snapshot
Real-time logics: complexity and expressiveness
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1109/tse.1986.6313045openalex-snapshot
Safety analysis of timing properties in real-time systems
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.21236/ada323441openalex-snapshot
Real-Time Logics: Complexity and Expressiveness,
inferredcites →https://doi.org/10.7551/mitpress/6874.001.0001openalex-snapshot
Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.3217/jucs-010-10-1383openalex-extracted
Platform Modeling and Model Transformations for Analysis
inferred← citeshttps://doi.org/10.1002/9780470611012.ch4openalex-snapshot
Model Checking Timed Automata
inferred← citeshttps://doi.org/10.1002/9781118459898.ch5openalex-snapshot
Symbolic Model Checking for Avionics
inferred← citeshttps://doi.org/10.1002/9781118558188.ch6openalex-snapshot
Tools for Model‐Checking Timed Systems
inferred← citeshttps://doi.org/10.1002/scj.10565openalex-snapshot
Development and evaluation of symbolic model checker based on approximation for real‐time systems
inferred← citeshttps://doi.org/10.1006/inco.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferred← citeshttps://doi.org/10.1006/inco.1993.1025openalex-snapshot
Real-Time Logics: Complexity and Expressiveness
inferred← citeshttps://doi.org/10.1006/inco.1995.1059openalex-snapshot
Timing Verification by Successive Approximation
inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_21openalex-snapshot
An Introduction to Hybrid Automata
inferred← citeshttps://doi.org/10.1007/10720327_3openalex-snapshot
Constraint Logic Programming Applied to Model Checking
inferred← citeshttps://doi.org/10.1007/10722167_9openalex-snapshot
Binary Reachability Analysis of Discrete Pushdown Timed Automata
inferred← citeshttps://doi.org/10.1007/11499909_13openalex-snapshot
Non-intrusive System Level Fault-Tolerance
inferred← citeshttps://doi.org/10.1007/11533092_1openalex-snapshot
A Logic for Knowledge, Correctness, and Real Time
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/11549970_17openalex-snapshot
Automatic Translation of WS-CDL Choreographies to Timed Automata
inferred← citeshttps://doi.org/10.1007/11576280_21openalex-snapshot
Symbolic Verification of Distributed Real-Time Systems with Complex Synchronizations
inferred← citeshttps://doi.org/10.1007/11841197_12openalex-snapshot
Analysis and Verification of Time Requirements Applied to the Web Services Composition
inferred← citeshttps://doi.org/10.1007/11867340_10openalex-snapshot
Model Checking Timed Automata with Priorities Using DBM Subtraction
inferred← citeshttps://doi.org/10.1007/11867340_5openalex-snapshot
Intersection of Regular Signal-Event (Timed) Languages
inferred← citeshttps://doi.org/10.1007/11867340_6openalex-snapshot
Refinements and Abstractions of Signal-Event (Timed) Languages
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-36577-x_20openalex-snapshot
√erics: A Tool for Verifying Timed Automata and Estelle Specifications
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_47openalex-snapshot
As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_19openalex-snapshot
Expressiveness of Updatable Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_15openalex-snapshot
Reachability Analysis for Some Models of Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_12openalex-snapshot
Reachability and Safety in Queue Systems
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_13openalex-snapshot
Generalizing the Discrete Timed Automaton
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_59openalex-snapshot
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_12openalex-snapshot
On Presburger Liveness of Discrete Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44947-7_5openalex-snapshot
Adding Temporal Annotations and Associated Verification to the Ravenscar Profile
inferred← citeshttps://doi.org/10.1007/3-540-45075-0_12openalex-snapshot
Specification and Simulation of Real Time Concurrent Systems Using Standard SDL Tools
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-45089-0_4openalex-snapshot
Timing Parameter Characterization of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_15openalex-snapshot
Automatic Derivation of Timing Constraints by Failure Analysis
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_25openalex-snapshot
Constructing Test Automata from Graphical Real-Time Requirements
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_3openalex-snapshot
Towards a Notion of Distributed Time for Petri Nets
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-46691-6_4openalex-snapshot
Renaming Is Necessary in Timed Regular Expressions
inferred← citeshttps://doi.org/10.1007/3-540-47764-0_17openalex-snapshot
Parametric Optimization of Open Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_20openalex-snapshot
Modeling and Checking Networks of Communicating Real-Time Processes
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_2openalex-snapshot
Automata, Circuits, and Hybrids: Facets of Continuous Time
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_14openalex-snapshot
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_18openalex-snapshot
Timed Automata and the Theory of Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_30openalex-snapshot
Partial Order Reduction for Model Checking of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_4openalex-snapshot
Automata and their interaction: Definitional suggestions
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_25openalex-snapshot
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
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-48683-6_30openalex-snapshot
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
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-48753-0_2openalex-snapshot
A Formal Model of the Ada Ravenscar Tasking Profile; Protected Objects
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-48983-5_9openalex-snapshot
A Geometric Approach to Bisimulation and Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_7openalex-snapshot
Verification of Bounded Delay Asynchronous Circuits with Timed Traces
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_64openalex-snapshot
Functional specification of time sensitive communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_128openalex-snapshot
Model-checking for probabilistic real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_38openalex-snapshot
Formal verification of speed-dependent asynchronous circuits using symbolic model checking of Branching Time Regular Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_41openalex-snapshot
Deciding properties of regular real timed processes
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_103openalex-snapshot
What good are digital clocks?
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_12openalex-snapshot
Timing verification by successive approximation
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_13openalex-snapshot
A verification strategy for timing constrained systems
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_22openalex-snapshot
Verification with real-time COSPAN
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_24openalex-snapshot
Decidability of bisimulation equivalences for parallel timer processes
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_16openalex-snapshot
Computing accumulated delays in real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_18openalex-snapshot
An efficient algorithm for minimizing real-time transition systems
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_20openalex-snapshot
Alternating RQ timed automata
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_30openalex-snapshot
An Elimination Theorem for regular behaviours with integration
inferred← citeshttps://doi.org/10.1007/3-540-57209-0_22openalex-snapshot
Integration of structured analysis and timed statecharts for real-time and concurrency specification
inferred← citeshttps://doi.org/10.1007/3-540-57318-6_30openalex-snapshot
Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_52openalex-snapshot
A real-time interval logic and its decision procedure
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_8openalex-snapshot
Time abstracted bisimulation: Implicit specifications and decidability
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_39openalex-snapshot
A determinizable class of timed automata
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_40openalex-snapshot
Real-time system verification using P/T nets
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_41openalex-snapshot
Criteria for the simple path property in timed automata
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_45openalex-snapshot
Using abstractions for the verification of linear hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_46openalex-snapshot
Decidability of hybrid systems with rectangular differential inclusions
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_47openalex-snapshot
Suspension automata: A decidable class of hybrid automata
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_56openalex-snapshot
Deciding properties of integral relational automata
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_58openalex-snapshot
On some relations between dynamical systems and transition systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_165openalex-snapshot
Verification of an audio control protocol
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_167openalex-snapshot
Predicting logical and temporal properties of real-time systems using Synchronized Elementary Nets
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_173openalex-snapshot
Verification methods for the divergent runs of clock systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_191openalex-snapshot
Specifying timed state sequences in powerful decidable logics and timed automata
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_43openalex-snapshot
Verification of linear hybrid systems by means of convex approximations
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_129openalex-snapshot
Decidability of timed language-inclusion for networks of real-time communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_66openalex-snapshot
Verification of real-time systems by successive over and under approximation
inferred← citeshttps://doi.org/10.1007/3-540-60472-3_18openalex-snapshot
Verification of hybrid systems using abstractions
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_22openalex-snapshot
On the power of non-observable actions in timed automata
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_55openalex-snapshot
Probabilistic duration automata for analyzing real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_73openalex-snapshot
Verification of an Audio Protocol with bus collision using Uppaal
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_74openalex-snapshot
Selective quantitative analysis and interval model checking: Verifying different facets of a system
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_5openalex-snapshot
The verus language: Representing time efficiently with BDDs
inferred← citeshttps://doi.org/10.1007/3-540-64358-3_44openalex-snapshot
Formal verification of safety-critical hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-65193-4_20openalex-snapshot
Model checking timed automata
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_12openalex-snapshot
On Specifying Services and Synthesizing Protocols for Real-Time Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_16openalex-snapshot
User-Friendly Verification
inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_24openalex-snapshot
Protocol Synthesis for Real-Time Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot
A Survey on Continuous Time Computations
inferred← citeshttps://doi.org/10.1007/978-1-4020-6254-4_6openalex-snapshot
All Those Duration Calculi: An Integrated Approach
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_1openalex-snapshot
Real-Time Calculi and Expansion Theorems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3431-2_6openalex-snapshot
Real-Time and Safety-Critical Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_9openalex-snapshot
An Introduction to Timed Automata
inferred← citeshttps://doi.org/10.1007/978-1-4613-9347-4_7openalex-snapshot
Modeling Real-Time Systems using Rate Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_12openalex-snapshot
On Timed Scope-Bounded Context-Sensitive Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_2openalex-snapshot
Abstraction Refinement Algorithms for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-40914-2_8openalex-snapshot
Compositional Liveness-Preserving Conformance Testing of Timed I/O Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-46902-3_3openalex-snapshot
Verifying Resource Adequacy of Networked IMA Systems at Concept Level
inferred← citeshttps://doi.org/10.1007/978-3-030-57628-8_15openalex-snapshot
Incremental Methods for Checking Real-Time Consistency
inferred← citeshttps://doi.org/10.1007/978-3-030-58298-2_2openalex-snapshot
Verifiable and Scalable Mission-Plan Synthesis for Autonomous Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-61470-6_5openalex-snapshot
Parametric Timed Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-030-65955-4_10openalex-snapshot
Accurate Strategy for Mixed Criticality Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-030-71472-7_9openalex-snapshot
Relation Between Test Coverage and Timed Automata Model Structure
inferred← citeshttps://doi.org/10.1007/978-3-031-06773-0_6openalex-snapshot
Reachability Analysis for Cyber-Physical Systems: Are We There Yet?
inferred← citeshttps://doi.org/10.1007/978-3-031-15008-1_13openalex-snapshot
Formally Verifying Decompositions of Stochastic Specifications
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-15839-1_2openalex-snapshot
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_13openalex-snapshot
Simulation Relations and Applications in Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-32157-3_9openalex-snapshot
Elimination of Detached Regions in Dependency Graph Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-35257-7_6openalex-snapshot
Verifying Refinement of Probabilistic Contracts Using Timed Automata
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-38821-7_7openalex-snapshot
Decomposable and Executable Models for Verification of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-43681-9_6openalex-snapshot
Refinement of Systems with an Attacker Focus
inferred← citeshttps://doi.org/10.1007/978-3-031-49252-5_7openalex-snapshot
Learning in Uppaal for Test Case Generation for Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-61433-0_10openalex-snapshot
Languages of Higher-Dimensional Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-64626-3_5openalex-snapshot
Safe and Infinite Resource Scheduling Using Energy Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-66456-4_10openalex-snapshot
Template-Based Smart Contract Verification: A Case Study on Maritime Transportation Domain
inferred← citeshttps://doi.org/10.1007/978-3-031-71261-6_8openalex-snapshot
How Do Asynchronous Communication Models Impact the Composability of Information Flow Security?
inferred← citeshttps://doi.org/10.1007/978-3-031-73751-0_12openalex-snapshot
Reminiscences of a Real-Time Researcher
inferred← citeshttps://doi.org/10.1007/978-3-032-10794-7_16openalex-snapshot
Security of the Lightning Network: Model Checking a Stepwise Refinement with TLA+
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_4openalex-snapshot
Higher-Dimensional Timed Automata for Real-Time Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_33openalex-snapshot
TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_16openalex-snapshot
Compositional Verification of Timed Automata via Violation Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-032-35298-9_19openalex-snapshot
Witnesses and Counterexamples for Timed Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-0348-8970-4_23openalex-snapshot
Control Synthesis for Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-04717-1_4openalex-snapshot
A Framework for Verification of SystemC Designs Using SystemC Waiting State Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-10407-2_42openalex-snapshot
Modeling Objects Moving in a Complex Environment with World Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_2openalex-snapshot
Modeling Bitcoin Contracts by Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_27openalex-snapshot
A Decidable Recursive Logic for Weighted Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11737-9_14openalex-snapshot
Timed Automata Verification via IC3 with Zones
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_28openalex-snapshot
Trace Abstraction Refinement for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_18openalex-snapshot
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
inferred← citeshttps://doi.org/10.1007/978-3-319-19195-9_10openalex-snapshot
Difference Bound Constraint Abstraction for Timed Automata Reachability Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_3openalex-snapshot
Language Preservation Problems in Parametric Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-23437-3_1openalex-snapshot
Modelling and Analysing Mixed Reality Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_97openalex-snapshot
Designing Schedulers for Hard Real-Time Tasks
inferred← citeshttps://doi.org/10.1007/978-3-319-33951-1_7openalex-snapshot
Failure Analysis of Chinese Train Control System Level 3 Based on Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_9openalex-snapshot
Compositional Design of Stochastic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_28openalex-snapshot
Symbolic Optimal Reachability in Weighted Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-43144-4_26openalex-snapshot
Formalized Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-44878-7_3openalex-snapshot
Modelling Attack-defense Trees Using Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-47169-3_25openalex-snapshot
What Is a Trace? A Runtime Verification Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-62410-5_21openalex-snapshot
Modeling and checking robustness of communicating autonomous vehicles
inferred← citeshttps://doi.org/10.1007/978-3-319-74860-3_5openalex-snapshot
Quantitative Evaluation of Attack Defense Trees Using Stochastic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-77452-7_9openalex-snapshot
Supervisory Control of Timed Discrete-Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-91334-6_18openalex-snapshot
Formal Verification: Focused on the Verification Using a Plant Model
inferred← citeshttps://doi.org/10.1007/978-3-322-94703-1_16openalex-snapshot
Improving Structured Analysis — Achieving Preciseness, Executability, and Real-Time Specification
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-24730-2_19openalex-snapshot
Resource-Optimal Scheduling Using Priced Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_25openalex-snapshot
Lower and Upper Bounds in Zone Based Abstractions of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_14openalex-snapshot
Staying Alive as Cheaply as Possible
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_3openalex-snapshot
Timed Automata: Semantics, Algorithms and Tools
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_4openalex-snapshot
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_41openalex-snapshot
Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-30121-9_2openalex-snapshot
Automatic Synthesis and Verification of Real-Time Embedded Software
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_24openalex-snapshot
Forward Reachability Analysis of Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_17openalex-snapshot
Abstraction-Based Model Checking Using Heuristical Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_38openalex-snapshot
Verification of WCDMA Protocols and Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_26openalex-snapshot
Formal Design and Verification of Real-Time Embedded Software
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_6openalex-snapshot
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_34openalex-snapshot
Composability of Infinite-State Activity Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_15openalex-snapshot
Optimal Conditional Reachability for Multi-priced Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-39979-7_11openalex-snapshot
Numerical Coverage Estimation for the Symbolic Simulation of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_5openalex-snapshot
Adding Symmetry Reduction to Uppaal
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_17openalex-snapshot
Digitizing Interval Duration Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-68624-8_18openalex-snapshot
Can We Increase the Usability of Real Time Scheduling Theory? The Cheddar Project
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_19openalex-snapshot
Complexity in Simplicity: Flexible Agent-Based State Space Exploration
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_20openalex-snapshot
On Sampling Abstraction of Continuous Time Logic with Durations
inferred← citeshttps://doi.org/10.1007/978-3-540-73230-3_14openalex-snapshot
Towards User-Level Extensibility of an Ada Library: An Experiment with Cheddar
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_6openalex-snapshot
Impossibility Results for the Equational Theory of Timed CCS
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_10openalex-snapshot
Automatic Abstraction Refinement for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_3openalex-snapshot
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-02617-1_3openalex-snapshot
The Dark Side of Timed Opacity
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_21openalex-snapshot
Exploiting Timed Automata for Conformance Testing of Power Measurements
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_3openalex-snapshot
Compositional and Quantitative Model Checking (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_2openalex-snapshot
Verification, Performance Analysis and Controller Synthesis for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_45openalex-snapshot
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
inferred← citeshttps://doi.org/10.1007/978-3-642-13464-7_10openalex-snapshot
Forgetting the Time in Timed Process Algebra
showing the first 200 of 792 · page through all 792
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.