On the public citation graph

Verifying networks of timed processes

0 signed · 82 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1993.1069openalex-snapshot

Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs

inferredcites →https://doi.org/10.1006/inco.1996.0053openalex-snapshot

Verifying Programs with Unreliable Channels

inferredcites →https://doi.org/10.1007/3-540-54233-7_136openalex-snapshot

CCS + time = an interleaving model for real time systems

inferredcites →https://doi.org/10.1007/3-540-57318-6_30openalex-snapshot

Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems

inferredcites →https://doi.org/10.1007/3-540-58201-0_56openalex-snapshot

Deciding properties of integral relational automata

inferredcites →https://doi.org/10.1007/3-540-60084-1_85openalex-snapshot

Hybrid automata with finite bisimulations

inferredcites →https://doi.org/10.1007/3-540-60218-6_25openalex-snapshot

Decidability of simulation and bisimulation between lossy channel systems and finite state systems

inferredcites →https://doi.org/10.1007/3-540-60218-6_26openalex-snapshot

Checking regular properties of Petri nets

inferredcites →https://doi.org/10.1007/3-540-60218-6_30openalex-snapshot

Verifying parameterized networks using abstraction and regular languages

inferredcites →https://doi.org/10.1007/bfb0020979openalex-snapshot

Fischer's protocol revisited: A simple proof using modal constraints

inferredcites →https://doi.org/10.1007/bfb0030626openalex-snapshot

A compositional proof of a real-time mutual exclusion protocol

inferredcites →https://doi.org/10.1007/bfb0032010openalex-snapshot

Putting time into proof outlines

inferredcites →https://doi.org/10.1016/0890-5401(90)90009-7openalex-snapshot

Reduction and covering of infinite reachability trees

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/32.67597openalex-snapshot

A unified high-level Petri net formalism for time-critical systems

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/lics.1990.113766openalex-snapshot

Model-checking for real-time systems

inferredcites →https://doi.org/10.1109/lics.1996.561359openalex-snapshot

General decidability theorems for infinite-state systems

inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot

Ordering by Divisibility in Abstract Algebras

inferredcites →https://doi.org/10.1145/146637.146681openalex-snapshot

Reasoning about systems with many processes

inferredcites →https://doi.org/10.1145/512644.512661openalex-snapshot

Expressing interesting properties of programs in propositional temporal logic

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.1145/72981.72998openalex-snapshot

A structural induction theorem for processes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10722167_26openalex-snapshot

Liveness and Acceleration in Parameterized Verification

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_1openalex-snapshot

Channel Representations in Protocol Verification

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_36openalex-snapshot

Symbolic Algorithms for Infinite-State Games

inferred← citeshttps://doi.org/10.1007/3-540-45657-0_22openalex-snapshot

Algorithmic Verification of Invalidation-Based Protocols

inferred← citeshttps://doi.org/10.1007/3-540-45739-9_12openalex-snapshot

Decidability of Safety Properties of Timed Multiset Rewriting

inferred← citeshttps://doi.org/10.1007/3-540-45740-2_5openalex-snapshot

Timed Petri Nets and BQOs

inferred← citeshttps://doi.org/10.1007/3-540-46002-0_16openalex-snapshot

Beyond Parameterized Verification

inferred← citeshttps://doi.org/10.1007/3-540-46432-8_3openalex-snapshot

Verifying Performance Equivalence for Timed Basic Parallel Processes

inferred← citeshttps://doi.org/10.1007/3-540-46541-3_2openalex-snapshot

A Classification of Symbolic Transition Systems

inferred← citeshttps://doi.org/10.1007/3-540-48092-7_9openalex-snapshot

On the Existence of Network Invariants for Verifying Parameterized Systems

inferred← citeshttps://doi.org/10.1007/3-540-48683-6_14openalex-snapshot

Handling Global Conditions in Parametrized System Verification

inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_22openalex-snapshot

Fixed Points and Noetherian Topologies

inferred← citeshttps://doi.org/10.1007/978-3-032-22730-0_21openalex-snapshot

Well-quasi-orderings on word languages

inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_42openalex-snapshot

Expressiveness of Dynamic Networks of Timed Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_21openalex-snapshot

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_16openalex-snapshot

Dynamic Networks of Timed Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-319-12154-3_15openalex-snapshot

Parameterized Model-Checking of Timed Systems with Conjunctive Guards

inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_13openalex-snapshot

Nested Timed Automata with Frozen Clocks

inferred← citeshttps://doi.org/10.1007/978-3-319-31220-0_11openalex-snapshot

On Reachability Analysis of Updatable Timed Automata with One Updatable Clock

inferred← citeshttps://doi.org/10.1007/978-3-319-57708-1_2openalex-snapshot

On Termination and Boundedness of Nested Updatable Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_24openalex-snapshot

Nested Timed Automata with Diagonal Constraints

inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_54openalex-snapshot

A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_1openalex-snapshot

Rewriting Systems with Data

inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_10openalex-snapshot

Decidability Results for Well-Structured Transition Systems with Auxiliary Storage

inferred← citeshttps://doi.org/10.1007/978-3-540-75698-9_7openalex-snapshot

Zone-Based Universality Analysis for Single-Clock Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-02138-1_4openalex-snapshot

Verification of Parameterized Systems with Combinations of Abstract Domains

inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_23openalex-snapshot

Weak Alternating Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-16265-7_12openalex-snapshot

Automatic Verification of Parametric Specifications with Complex Topologies

inferred← citeshttps://doi.org/10.1007/978-3-662-54580-5openalex-snapshot

Tools and Algorithms for the Construction and Analysis of Systems

inferred← citeshttps://doi.org/10.1007/bfb0054180openalex-snapshot

Model checking of real-time reachability properties using abstractions

inferred← citeshttps://doi.org/10.1007/s00236-010-0121-8openalex-snapshot

Reachability results for timed automata with unbounded data structures

inferred← citeshttps://doi.org/10.1007/s10009-016-0412-7openalex-snapshot

A unified view of parameterized verification of abstract models of broadcast communication

inferred← citeshttps://doi.org/10.1007/s10009-016-0424-3openalex-snapshot

Parameterized verification

inferred← citeshttps://doi.org/10.1007/s11432-016-9027-yopenalex-snapshot

Updatable timed automata with one updatable clock

inferred← citeshttps://doi.org/10.1016/j.entcs.2003.10.004openalex-snapshot

A Symbolic Procedure for Control Reachability in the Asynchronous π-calculus

inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00149-0openalex-snapshot

A note on well quasi-orderings for powersets

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00102-xopenalex-snapshot

Well-structured transition systems everywhere!

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00105-5openalex-snapshot

Ensuring completeness of symbolic verification methods for infinite-state systems

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00189-6openalex-snapshot

An Assertional Language for the Verification of Systems Parametric in Several Dimensions

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80786-2openalex-snapshot

An Overview of MSR( )

inferred← citeshttps://doi.org/10.1109/lics.2000.855762openalex-snapshot

Better is better than well: on efficient verification of infinite-state systems

inferred← citeshttps://doi.org/10.1109/lics.2001.932483openalex-snapshot

A bound on attacks on payment protocols

inferred← citeshttps://doi.org/10.1109/lics.2004.1319600openalex-snapshot

On the language inclusion problem for timed automata: closing a decidability gap

inferred← citeshttps://doi.org/10.1145/1042038.1042039openalex-snapshot

A classification of symbolic transition systems

inferred← citeshttps://doi.org/10.1145/1342991.1342994openalex-snapshot

Alternating timed automata

inferred← citeshttps://doi.org/10.1145/2670529.2754966openalex-snapshot

StarL

inferred← citeshttps://doi.org/10.14279/depositonce-3248openalex-snapshot

Mechanical Verification of Parameterized Real-Time Systems

inferred← citeshttps://doi.org/10.17760/d20328155openalex-snapshot

Resource-aware program analysis using observation sequences

inferred← citeshttps://doi.org/10.21236/ada461167openalex-snapshot

On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap

inferred← citeshttps://doi.org/10.2168/lmcs-3(1:1)2007openalex-snapshot

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness

inferred← citeshttps://doi.org/10.2168/lmcs-5(2:3)2009openalex-snapshot

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

inferred← citeshttps://doi.org/10.2178/bsl/1294171129openalex-snapshot

Well (and Better) Quasi-Ordered Transition Systems

inferred← citeshttps://doi.org/10.22028/d291-25960openalex-snapshot

Hierarchic decision procedures for verification

inferred← citeshttps://doi.org/10.4204/eptcs.103.1openalex-snapshot

Adding Time to Pushdown Automata

inferred← citeshttps://doi.org/10.4230/drops.memics.2009.2356openalex-snapshot

Rewriting Systems over Nested Data Words

inferred← citeshttps://doi.org/10.4230/lites.8.2.7openalex-snapshot

Real-Time Verification for Distributed Cyber-Physical Systems

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0409052openalex-snapshot

Better Quasi-Ordered Transition Systems

inferred← citeshttps://doi.org/10.5281/zenodo.209764openalex-snapshot

FIGURE 5. Mesocoelium burti—NHMUK 1980.11.12 4 in A reevaluation of specimens of Mesocoelium monas (Platyhelminthes: Digenea: Mesocoeliidae) from the Natural History Museum, UK and the United States National Parasite Collection, USA

inferred← citeshttps://doi.org/10.5555/1775223.1775230openalex-snapshot

Zone-based universality analysis for single-clock timed automata

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.