On the public citation graph
Fischer's protocol revisited: A simple proof using modal constraints
0 signed · 47 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-51237-3_14openalex-snapshot
The use of static constructs in a model process logic
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-55179-4_20openalex-snapshot
Generating BDDs for symbolic model checking in CCS
inferredcites →https://doi.org/10.1007/3-540-55179-4_32openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferredcites →https://doi.org/10.1007/3-540-56496-9_24openalex-snapshot
Decidability of bisimulation equivalences for parallel timer processes
inferredcites →https://doi.org/10.1007/3-540-56922-7_21openalex-snapshot
Timed modal specification — Theory and tools
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_36openalex-snapshot
Refining dependencies improves partial-order verification methods (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-60218-6_3openalex-snapshot
Compositional model checking of real time systems
inferredcites →https://doi.org/10.1007/3-540-60630-0_2openalex-snapshot
A constraint oriented proof methodology based on modal transition systems
inferredcites →https://doi.org/10.1007/bf01383879openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferredcites →https://doi.org/10.1007/bf02242704openalex-snapshot
Generating BDDs for symbolic model checking in CCS
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0023732openalex-snapshot
Compositional minimization of finite state systems
inferredcites →https://doi.org/10.1016/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
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/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/186025.186058openalex-snapshot
An old-fashioned recipe for real time
inferredcites →https://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferredcites →https://doi.org/10.7146/brics.v4i11.18802openalex-snapshot
Timed Modal Specification —Theory and Tools
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11562436_22openalex-snapshot
Modeling and Verification of Safety-Critical Systems Using Safecharts
inferred← citeshttps://doi.org/10.1007/11754008_19openalex-snapshot
Test Case Minimization for Real-Time Systems Using Timed Bound Traces
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_1openalex-snapshot
Robust Structural Transformations for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_3openalex-snapshot
30 Years of Modal Transition Systems: Survey of Extensions and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_8openalex-snapshot
On Modal Refinement and Consistency
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/bfb0014735openalex-snapshot
Weak refinement for modal hybrid systems
inferred← citeshttps://doi.org/10.1007/bfb0023458openalex-snapshot
Efficient scaling-invariant checking of timed bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0024437openalex-snapshot
The methodology of modal constraints
inferred← citeshttps://doi.org/10.1007/bfb0054179openalex-snapshot
Verifying networks of timed processes
inferred← citeshttps://doi.org/10.1007/s00165-014-0306-yopenalex-snapshot
Structural transformations for data-enriched real-time systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.06.011openalex-snapshot
EXPTIME-complete Decision Problems for Modal and Mixed Specifications
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00330-9openalex-snapshot
Model checking of systems with many identical timed processes
inferred← citeshttps://doi.org/10.1016/s1383-7621(00)00034-5openalex-snapshot
Embedded software verification in hardware–software codesign
inferred← citeshttps://doi.org/10.1109/12.980017openalex-snapshot
Efficient and user-friendly verification
inferred← citeshttps://doi.org/10.1109/cmpsac.2000.884775openalex-snapshot
Concurrent embedded real-time software verification
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/tc.2007.1021openalex-snapshot
Model Checking Safety-Critical Systems Using Safecharts
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.