On the public citation graph

Using mappings to prove timing properties

https://doi.org/10.1007/bf02252683
0 signed · 79 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.1025openalex-snapshot
Real-Time Logics: Complexity and Expressiveness
inferredcites →https://doi.org/10.1007/3-540-17945-3_18openalex-snapshot
A compositional proof theory for real-time distributed message passing
inferredcites →https://doi.org/10.1007/3-540-19488-6_145openalex-snapshot
Assertional verification of a timer based protocol
inferredcites →https://doi.org/10.1007/3-540-54430-5_103openalex-snapshot
Time-constrained automata
inferredcites →https://doi.org/10.1007/bf01667079openalex-snapshot
Time-dependent distributed systems: proving safety, liveness and real-time properties
inferredcites →https://doi.org/10.1007/bfb0031985openalex-snapshot
An old-fashioned recipe for real time
inferredcites →https://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1016/0164-1212(92)90045-lopenalex-snapshot
Formal methods for the specification and design of real-time safety critical systems
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1109/32.29487openalex-snapshot
Reasoning about time in higher-level language software
inferredcites →https://doi.org/10.1109/71.80145openalex-snapshot
Deciding properties of timed transition models
inferredcites →https://doi.org/10.1109/9.52290openalex-snapshot
A framework for real-time discrete event control
inferredcites →https://doi.org/10.1109/lics.1990.113764openalex-snapshot
Real-time logics: complexity and expressiveness
inferredcites →https://doi.org/10.1109/lics.1990.113765openalex-snapshot
Explicit clock temporal logic
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1109/real.1988.51095openalex-snapshot
State-based specification of complex real-time systems
inferredcites →https://doi.org/10.1109/tc.1987.5009519openalex-snapshot
A Graph-Theoretic Approach for Timing Analysis and its Implementation
inferredcites →https://doi.org/10.1109/tse.1981.231111openalex-snapshot
Real-Time Behavior of Programs
inferredcites →https://doi.org/10.1109/tse.1983.235261openalex-snapshot
Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
inferredcites →https://doi.org/10.1145/1067627.806585openalex-snapshot
Proving real-time properties of programs with temporal logic
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/588078.588080openalex-snapshot
Concurrency control for resilient nested transactions
inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules
inferredcites →https://doi.org/10.1145/71021.71024openalex-snapshot
The Spring kernel: a new paradigm for real-time operating systems
inferredcites →https://doi.org/10.1145/800105.803398openalex-snapshot
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
inferredcites →https://doi.org/10.1145/800221.806721openalex-snapshot
Real-time programming and asynchronous message passing
inferredcites →https://doi.org/10.1145/93385.93428openalex-snapshot
Using mappings to prove timing properties
inferredcites →https://doi.org/10.1145/99583.99629openalex-snapshot
Temporal proof methodologies for real-time systems
inferredcites →https://doi.org/10.21236/ada213791openalex-snapshot
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty
inferredcites →https://doi.org/10.21236/ada234404openalex-snapshot
Using Mappings to Prove Timing Properties
inferredcites →https://doi.org/10.21236/ada323441openalex-snapshot
Real-Time Logics: Complexity and Expressiveness,

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1996.0060openalex-snapshot
Forward and Backward Simulations
inferred← citeshttps://doi.org/10.1007/11603009_3openalex-snapshot
Translating Timed I/O Automata Specifications for Theorem Proving in PVS
inferred← citeshttps://doi.org/10.1007/3-540-44830-6_16openalex-snapshot
A Guided Method for Testing Timed Input Output Automata
inferred← citeshttps://doi.org/10.1007/3-540-48257-1_9openalex-snapshot
A Practical Hierarchical Design by Timed Simulation Relations for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_24openalex-snapshot
Simulation techniques for proving properties of real-time systems
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-61604-7_75openalex-snapshot
Verifying abstractions of timed systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_1openalex-snapshot
Proving Performance Properties (even Probabilistic Ones)
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-540-75454-1_4openalex-snapshot
Undecidability of Universality for Timed Automata with Minimal Resources
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_33openalex-snapshot
Time-Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_3openalex-snapshot
Towards a Theory of Time-Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_12openalex-snapshot
Timed Automata
inferred← citeshttps://doi.org/10.1007/978-94-011-0305-3_3openalex-snapshot
Timing Problems and Their Handling at System Integration
inferred← citeshttps://doi.org/10.1007/bf01191625openalex-snapshot
Efficiency of semisynchronous versus asynchronous networks
inferred← citeshttps://doi.org/10.1007/bf01211907openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/bfb0020967openalex-snapshot
Modelling and verification of automated transit systems, using timed automata, invariants and simulations
inferred← citeshttps://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0023456openalex-snapshot
Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification
inferred← citeshttps://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferred← citeshttps://doi.org/10.1007/bfb0084808openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1016/b978-0-08-042374-6.50017-1openalex-snapshot
THE IMPACT OF SAFETY AND RELIABILITY REQUIREMENTS ON THE SPECIFICATION OF CONTROL SYSTEMS
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00036-1openalex-snapshot
Hybrid diagrams
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/s1474-6670(17)45714-4openalex-snapshot
The Impact of Safety and Reliability Requirements on the Specification of Control Systems
inferred← citeshttps://doi.org/10.1109/2.223535openalex-snapshot
Formal models of communication services: a case study
inferred← citeshttps://doi.org/10.1109/32.153384openalex-snapshot
Detecting unsafe error recovery schedules
inferred← citeshttps://doi.org/10.1109/32.935853openalex-snapshot
Simulation-verification: biting at the state explosion problem
inferred← citeshttps://doi.org/10.1109/5.259433openalex-snapshot
A process algebraic approach to the specification and analysis of resource-bound real-time systems
inferred← citeshttps://doi.org/10.1109/5.259434openalex-snapshot
Reasoning assertionally about real-time systems
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184462openalex-snapshot
Submodule construction for timed systems
inferred← citeshttps://doi.org/10.1109/emwrt.1993.639097openalex-snapshot
Analytical Study of Quantitative Timing Properties of Software
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.1109/real.1994.342724openalex-snapshot
The generalized railroad crossing: a case study in formal verification of real-time systems
inferred← citeshttps://doi.org/10.1109/real.1998.739748openalex-snapshot
Timed test cases generation based on state characterization technique
inferred← citeshttps://doi.org/10.1109/rtcsa.1999.811206openalex-snapshot
Fault coverage in testing real-time systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2000.896421openalex-snapshot
Testing embedded real-time systems
inferred← citeshttps://doi.org/10.1109/rttas.1996.509536openalex-snapshot
Mechanical verification of timed automata: a case study
inferred← citeshttps://doi.org/10.1109/tse.2002.1049402openalex-snapshot
Timed Wp-method: testing real-time systems
inferred← citeshttps://doi.org/10.1142/s021819409600017xopenalex-snapshot
A METHODOLOGY AND SUPPORT TOOLS FOR ANALYSIS OF REAL-TIME SPECIFICATIONS
inferred← citeshttps://doi.org/10.1145/164051.164068openalex-snapshot
Designing algorithms for distributed systems with partially synchronized clocks
inferred← citeshttps://doi.org/10.1145/195058.195136openalex-snapshot
Efficient asynchronous distributed symmetry breaking
inferred← citeshttps://doi.org/10.1145/222124.222140openalex-snapshot
Liveness conditions in model-based service specifications
inferred← citeshttps://doi.org/10.1145/222132.222140openalex-snapshot
Liveness conditions in model-based service specifications
inferred← citeshttps://doi.org/10.1145/224964.224984openalex-snapshot
Formal verification of timed properties of randomized distributed algorithms
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.