On the public citation graph
Partial order reductions for timed systems
0 signed · 147 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-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/3-540-56922-7_27openalex-snapshot
Efficient verification of parallel real-time systems
inferredcites →https://doi.org/10.1007/3-540-56922-7_33openalex-snapshot
On-the-fly verification with stubborn sets
inferredcites →https://doi.org/10.1007/3-540-56922-7_34openalex-snapshot
All from one, one for all: on model checking using representatives
inferredcites →https://doi.org/10.1007/3-540-60472-3_14openalex-snapshot
HyTech: The Cornell Hybrid Technology Tool
inferredcites →https://doi.org/10.1007/3-540-60761-7openalex-snapshot
Partial-Order Methods for the Verification of Concurrent Systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_73openalex-snapshot
Verification of an Audio Protocol with bus collision using Uppaal
inferredcites →https://doi.org/10.1007/3-540-61648-9_49openalex-snapshot
Partial orders and verification of real-time systems
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_13openalex-snapshot
An Improvement in Formal Verification
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_18openalex-snapshot
Automatic Verification of Real-Time Communicating Systems by Constraint-Solving
inferredcites →https://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1023/a:1008682131325openalex-snapshot
Efficient Verification of Parallel Real–Time Systems
inferredcites →https://doi.org/10.1090/dimacs/003/21openalex-snapshot
Using partial orders to improve automatic verification methods
inferredcites →https://doi.org/10.1109/32.75415openalex-snapshot
Modeling and verification of time dependent systems using time Petri nets
inferredcites →https://doi.org/10.1109/real.1995.495198openalex-snapshot
Compositional and symbolic model-checking of real-time systems
inferredcites →https://doi.org/10.1109/real.1997.641265openalex-snapshot
Efficient verification of real-time systems: compact data structure and state-space reduction
inferredcites →https://doi.org/10.1145/84537.84545openalex-snapshot
Parallel discrete event simulation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/tee.22457openalex-snapshot
Efficient encoding for bounded model checking of timed automata
inferred← citeshttps://doi.org/10.1007/11560647_18openalex-snapshot
Symbolic Model Checking of Finite Precision Timed Automata
inferred← citeshttps://doi.org/10.1007/11817949openalex-snapshot
CONCUR 2006 - concurrency theory : 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 : proceedings
inferred← citeshttps://doi.org/10.1007/11817949_31openalex-snapshot
On Interleaving in Timed Automata
inferred← citeshttps://doi.org/10.1007/11817963_24openalex-snapshot
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
inferred← citeshttps://doi.org/10.1007/11867340_21openalex-snapshot
Adding Invariants to Event Zone Automata
inferred← citeshttps://doi.org/10.1007/11901914_23openalex-snapshot
Timed Unfoldings for Networks of Timed Automata
inferred← citeshttps://doi.org/10.1007/11901914_24openalex-snapshot
Symbolic Unfoldings for Networks of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_4openalex-snapshot
Verification of Timed and Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_4openalex-snapshot
UPPAAL - Now, Next, and Future
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_15openalex-snapshot
Verification of Timed Automata via Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_17openalex-snapshot
Towards Bounded Model Checking for the Universal Fragment of TCTL
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-45740-2_19openalex-snapshot
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_5openalex-snapshot
Product Interval Automata: A Subclass of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-48234-2_4openalex-snapshot
Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness
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_46openalex-snapshot
A partial order method for the verification of time Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_14openalex-snapshot
Parametric Behaviour Analysis for Time Petri Nets*
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_18openalex-snapshot
Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_20openalex-snapshot
Partial Order Reduction for Deep Bug Finding in Synchronous Hardware
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_10openalex-snapshot
Urgent Partial Order Reduction for Extended Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-65955-4_8openalex-snapshot
Towards Efficient Partial Order Techniques for Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-85037-1_3openalex-snapshot
Stubborn Set Reduction for Timed Reachability and Safety Games
inferred← citeshttps://doi.org/10.1007/978-3-030-95561-8_4openalex-snapshot
Partial Order Reduction for Timed Actors
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-42626-1_7openalex-snapshot
A Local-Time Semantics for Negotiations
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_19openalex-snapshot
Using Communication to Bound Clock Drift in Local-Timed Negotiations
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_37openalex-snapshot
A Graph-Based Transformation Reduction to Reach UPPAAL States Faster
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_26openalex-snapshot
Diamonds Are a Girl’s Best Friend: Partial Order Reduction for Timed Automata with Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_5openalex-snapshot
Delay-Dependent Partial Order Reduction Technique for Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_29openalex-snapshot
Model Checking Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_26openalex-snapshot
Comparing Source Sets and Persistent Sets for Partial Order Reduction
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-319-96145-3_28openalex-snapshot
Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_24openalex-snapshot
A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata
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-30182-0_58openalex-snapshot
Stubborn Sets for Priority Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_26openalex-snapshot
Open Maps and Trace Semantics for Timed Partial Order Models
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_22openalex-snapshot
ELSE: A New Symbolic State Generator for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_3openalex-snapshot
Checking ACTL * Properties of Discrete Timed Automata via Bounded Model Checking
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-45069-6_40openalex-snapshot
To Store or Not to Store
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_16openalex-snapshot
Partial Order Reduction for Verification of Real-Time Components
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_10openalex-snapshot
Distributed Timed Automata with Independently Evolving Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_23openalex-snapshot
Component-Based Design and Analysis of Embedded Systems with UPPAAL PORT
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-04368-0_11openalex-snapshot
Removing All Silent Transitions from Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_34openalex-snapshot
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13464-7_13openalex-snapshot
Model Checking of Hybrid Systems Using Shallow Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_18openalex-snapshot
Layered Composition for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_25openalex-snapshot
Efficient Scenario Verification for Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_23openalex-snapshot
Distributed Event Clock Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_9openalex-snapshot
Avoiding Shared Clocks in Networks of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_26openalex-snapshot
Structural Transformations for Data-Enriched Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_18openalex-snapshot
Compositional Invariant Generation for Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_4openalex-snapshot
HyComp: An SMT-Based Model Checker for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/s00165-014-0306-yopenalex-snapshot
Structural transformations for data-enriched real-time systems
inferred← citeshttps://doi.org/10.1007/s10703-012-0158-0openalex-snapshot
SMT-based scenario verification for hybrid systems
inferred← citeshttps://doi.org/10.1007/s11241-017-9297-0openalex-snapshot
Delay-dependent partial order reduction technique for real time systems
inferred← citeshttps://doi.org/10.1016/j.ins.2014.06.006openalex-snapshot
Partial order reduction for checking soundness of time workflow nets
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.11.003openalex-snapshot
Reachability relations of timed pushdown automata
inferred← citeshttps://doi.org/10.1016/j.ress.2013.06.007openalex-snapshot
A methodology for formal analysis and verification of EAST-ADL models
inferred← citeshttps://doi.org/10.1016/j.scico.2014.07.005openalex-snapshot
Timed Rebeca schedulability and deadlock freedom analysis using bounded floating time transition system
inferred← citeshttps://doi.org/10.1016/j.scico.2017.11.004openalex-snapshot
An efficient TCTL model checking algorithm and a reduction technique for verification of timed actor models
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.023openalex-snapshot
A partial order semantics approach to the clock explosion problem of timed automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.012openalex-snapshot
Automatic generation of path conditions for concurrent timed systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80476-6openalex-snapshot
Modular Synthesis of Timed Circuits using Partial Orders on LPNs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80254-3openalex-snapshot
Efficient State Space Search for Time Petri Nets
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80627-9openalex-snapshot
Distributed Timed Automata
inferred← citeshttps://doi.org/10.1023/b:ause.0000038937.18006.3dopenalex-snapshot
Cluster-Based Partial-Order Reduction
inferred← citeshttps://doi.org/10.1049/ic:19980529openalex-snapshot
Modelling and analysis of broadcasting embedded control systems
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.11.3007openalex-snapshot
Double Depth First Search Based Parametric Analysis for Parametric Time-Interval Automata
inferred← citeshttps://doi.org/10.1109/43.845076openalex-snapshot
Timed state space exploration using POSETs
inferred← citeshttps://doi.org/10.1109/43.905681openalex-snapshot
Timed circuit verification using TEL structures
inferred← citeshttps://doi.org/10.1109/acsd.2015.20openalex-snapshot
Preserving Partial Order Runs in Parametric Time Petri Nets
inferred← citeshttps://doi.org/10.1109/acsd.2018.00007openalex-snapshot
Partial-Order Reduction for Performance Analysis of Max-Plus Timed Systems
inferred← citeshttps://doi.org/10.1109/ase.2001.989810openalex-snapshot
Enhancing partial-order reduction via process clustering
inferred← citeshttps://doi.org/10.1109/hase.1998.731605openalex-snapshot
Automatic verification on the large
inferred← citeshttps://doi.org/10.1109/iccd.2003.1240869openalex-snapshot
Verification of timed circuits with failure directed abstractions
inferred← citeshttps://doi.org/10.1109/jproc.2004.831197openalex-snapshot
Formal verification of timed systems: a survey and perspective
inferred← citeshttps://doi.org/10.1109/lics.2002.1029827openalex-snapshot
Computing reachability relations in timed automata
inferred← citeshttps://doi.org/10.1109/prdc.2002.1185640openalex-snapshot
Level oriented formal model for asynchronous circuit verification and its efficient analysis method
inferred← citeshttps://doi.org/10.1109/real.1998.739752openalex-snapshot
On checking timed automata for linear duration invariants
inferred← citeshttps://doi.org/10.1109/rtcsa.1998.726415openalex-snapshot
A state graph manipulator tool for real-time system specification and verification
inferred← citeshttps://doi.org/10.1109/rtss.2008.46openalex-snapshot
Synthesizing Certificates in Networks of Timed Automata
inferred← citeshttps://doi.org/10.1109/seaa.2011.49openalex-snapshot
HyDI: A Language for Symbolic Hybrid Systems with Discrete Interaction
inferred← citeshttps://doi.org/10.1109/seaa.2014.70openalex-snapshot
A Model-Based Testing Framework for Automotive Embedded Systems
inferred← citeshttps://doi.org/10.1109/tac.2021.3129161openalex-snapshot
Partial-Order Reduction for Supervisory Controller Synthesis
inferred← citeshttps://doi.org/10.1109/tase.2019.00-14openalex-snapshot
Optimized Step Semantics Encoding for Bounded Model Checking of Timed Automata
inferred← citeshttps://doi.org/10.1109/tcad.2003.816214openalex-snapshot
Modular verification of timed circuits using automatic abstraction
inferred← citeshttps://doi.org/10.1109/tcad.2005.854638openalex-snapshot
Verification of timed circuits with failure-directed abstractions
inferred← citeshttps://doi.org/10.1109/time.2009.14openalex-snapshot
Simple Algorithm for Simple Timed Games
inferred← citeshttps://doi.org/10.1109/time.2016.10openalex-snapshot
The Model Checking Problem in Networks with Quasi-Equal Clocks
inferred← citeshttps://doi.org/10.1145/3012283openalex-snapshot
Preserving Partial-Order Runs in Parametric Time Petri Nets
inferred← citeshttps://doi.org/10.1145/3531130.3533343openalex-snapshot
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
inferred← citeshttps://doi.org/10.1145/3559736.3559738openalex-snapshot
Reachability in timed automata
inferred← citeshttps://doi.org/10.1360/jos170001openalex-snapshot
Reachability Checking of Finite Precision Timed Automata
inferred← citeshttps://doi.org/10.15168/11572_368887openalex-snapshot
Verification of Hybrid Systems using Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8442openalex-snapshot
SMT-Based Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:13)2013openalex-snapshot
Avoiding Shared Clocks in Networks of Timed Automata
inferred← citeshttps://doi.org/10.22215/etd/2021-14841openalex-snapshot
A Cyberattack Impact Analysis Approach for Industrial Control Systems
inferred← citeshttps://doi.org/10.25100/iyc.v15i2.2599openalex-snapshot
Modelamiento y especificación de sistemas distribuidos y temporizados
inferred← citeshttps://doi.org/10.3166/jesa.39.63-78openalex-snapshot
Abstractions de modèles en automates temporisés pour la validation temporelle d'architectures embarquées
inferred← citeshttps://doi.org/10.3233/fi-2014-1140openalex-snapshot
Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking
inferred← citeshttps://doi.org/10.3233/fi-2014-996openalex-snapshot
Distributed Timed Automata with Independently Evolving Clocks
inferred← citeshttps://doi.org/10.3233/fun-2004-63104openalex-snapshot
ACTLS properties and Bounded Model Checking
inferred← citeshttps://doi.org/10.3233/fun-2007-791-211openalex-snapshot
Bounded Model Checking for the Existential Fragment of TCTL_{-G} and Diagonal Timed Automata
inferred← citeshttps://doi.org/10.3233/jcs-2009-0351openalex-snapshot
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
inferred← citeshttps://doi.org/10.4230/lipics.concur.2019.16openalex-snapshot
Revisiting Local Time Semantics for Networks of Timed Automata
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2010.101openalex-snapshot
Towards WCET Analysis of Multicore Architectures Using UPPAAL
inferred← citeshttps://doi.org/10.48550/arxiv.1609.03847openalex-snapshot
Instrumenting an SMT Solver to Solve Hybrid Network Reachability Problems
inferred← citeshttps://doi.org/10.54337/aau429765826openalex-snapshot
Time For Stubborn Game Reductions
inferred← citeshttps://doi.org/10.5555/2157654.2157666openalex-snapshot
Proving and explaining the unfeasibility of Message Sequence Charts for hybrid systems
inferred← citeshttps://doi.org/10.58837/chula.the.2021.953openalex-snapshot
การตดไทมเพทรเนตโดยใชคณสมบตตรรกะเชงเวลาแบบเมตรก
inferred← citeshttps://doi.org/10.6100/ir549628openalex-snapshot
Enhancing state space reduction techniques for model checking
inferred← citeshttps://doi.org/10.70675/9b30e78bz14d3z4391z96afze59585000e73openalex-snapshot
Validation formelle des systèmes numériques critiques : génération de l'espace d'états de réseaux de Petri exécutés en synchrone
inferred← citeshttps://doi.org/10.70675/f5fc5032zc27dz4fffza3cbzd9a01566f10dopenalex-snapshot
Partial order reduction for timed systems
inferred← citeshttps://doi.org/10.7146/brics.v7i37.20203openalex-snapshot
Guided Synthesis of Control Programs for a Batch Plant using UPPAAL
inferred← citeshttps://doi.org/10.82444/warw.33642649openalex-snapshot
Theoretical and practical tools for validating discrete and real-time systems
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.