On the public citation graph
Models for reactivity
0 signed · 103 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-16047-7_50openalex-snapshot
Examples of a real-time temporal logic specification
inferredcites →https://doi.org/10.1007/3-540-50302-1_4openalex-snapshot
Applications of temporal logic to the specification of real time systems
inferredcites →https://doi.org/10.1007/3-540-55092-5_32openalex-snapshot
Timed and Hybrid Statecharts and their textual representation
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/bf01178579openalex-snapshot
From ATP to timed graphs and hybrid systems
inferredcites →https://doi.org/10.1007/bf01995674openalex-snapshot
Specifying real-time properties with metric temporal logic
inferredcites →https://doi.org/10.1007/bfb0031985openalex-snapshot
An old-fashioned recipe for real time
inferredcites →https://doi.org/10.1007/bfb0032006openalex-snapshot
An overview and synthesis on timed process algebras
inferredcites →https://doi.org/10.1007/bfb0032007openalex-snapshot
From ATP to timed graphs and hybrid systems
inferredcites →https://doi.org/10.1007/bfb0036932openalex-snapshot
Proving precedence properties: The temporal way
inferredcites →https://doi.org/10.1007/bfb0039073openalex-snapshot
A temporal calculus of communicating systems
inferredcites →https://doi.org/10.1007/bfb0084790openalex-snapshot
How vital is liveness? Verifying timing properties of reactive and hybrid systems
inferredcites →https://doi.org/10.1016/0020-0190(92)90005-gopenalex-snapshot
Sooner is safer than later
inferredcites →https://doi.org/10.1016/0167-6423(87)90035-9openalex-snapshot
Statecharts: a visual formalism for complex systems
inferredcites →https://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferredcites →https://doi.org/10.1109/lics.1990.113765openalex-snapshot
Explicit clock temporal logic
inferredcites →https://doi.org/10.1145/1067627.806585openalex-snapshot
Proving real-time properties of programs with temporal logic
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/800221.806721openalex-snapshot
Real-time programming and asynchronous message passing
inferredcites →https://doi.org/10.1145/99583.99629openalex-snapshot
Temporal proof methodologies for real-time systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48734-9_8openalex-snapshot
A UML Profile for Real-Time System Modelling with Rate Monotonic Analysis
inferred← citeshttps://doi.org/10.1007/11753728_23openalex-snapshot
Expressiveness of Metric Modalities for Continuous Time
inferred← citeshttps://doi.org/10.1007/11821069_43openalex-snapshot
An Expressive Temporal Logic for Real Time
inferred← citeshttps://doi.org/10.1007/3-540-34874-3_6openalex-snapshot
A Theory of Interactive Computation
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_7openalex-snapshot
On Algorithms and Interaction
inferred← citeshttps://doi.org/10.1007/3-540-45648-1_25openalex-snapshot
Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_4openalex-snapshot
An operational semantics for timed RAISE
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-48321-7_4openalex-snapshot
Automata and their interaction: Definitional suggestions
inferred← citeshttps://doi.org/10.1007/3-540-49163-5_13openalex-snapshot
Time-Deterministic Hybrid Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-49646-7_1openalex-snapshot
CoRSA - A Constraint Based Approach to Requirements and Safety Analysis
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_123openalex-snapshot
Temporal verification diagrams
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_177openalex-snapshot
Proving safety properties of hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_187openalex-snapshot
Languages for reactive specifications: Synchrony vs asynchrony
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_188openalex-snapshot
Specification and verification of controlled 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-58468-4_192openalex-snapshot
A calculus for hybrid sampled data systems
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_60openalex-snapshot
Verification in continuous time by discrete reasoning
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_12openalex-snapshot
A formal definition of hierarchical predicate transition nets
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_77openalex-snapshot
Temporal verification by diagram transformations
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_39openalex-snapshot
Weak chop inverses and liveness in Mean-Value Calculus
inferred← citeshttps://doi.org/10.1007/3-540-65193-4_18openalex-snapshot
Verification of clocked and hybrid systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34685-4_5openalex-snapshot
Temporal Reasoning Of Reactive Web Services
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_28openalex-snapshot
A Combination of Interval Logic and Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_23openalex-snapshot
Specification of Hybrid Systems in CRP
inferred← citeshttps://doi.org/10.1007/978-3-030-48006-6_16openalex-snapshot
The Expressive Power of Temporal and First-Order Metric Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_33openalex-snapshot
Adaptive Stabilization of Reactive Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_12openalex-snapshot
Game Models for Open Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_8openalex-snapshot
Stabilization in Dynamic Systems with Varying Equilibrium
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5openalex-snapshot
Formal Modeling and Analysis of Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_8openalex-snapshot
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_1openalex-snapshot
A Calculus for Hybrid CSP
inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_6openalex-snapshot
Probabilistic Real-Time Rewrite Theories and Their Expressive Power
inferred← citeshttps://doi.org/10.1007/bf02943525openalex-snapshot
Hybridity in embedded computing systems
inferred← citeshttps://doi.org/10.1007/bf02946611openalex-snapshot
Completeness of the accumulation calculus
inferred← citeshttps://doi.org/10.1007/bfb0020933openalex-snapshot
Verifying clocked transition systems
inferred← citeshttps://doi.org/10.1007/bfb0023456openalex-snapshot
Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification
inferred← citeshttps://doi.org/10.1007/bfb0023457openalex-snapshot
Temporal logics for the specification of performance and reliability
inferred← citeshttps://doi.org/10.1007/pl00013313openalex-snapshot
‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’
inferred← citeshttps://doi.org/10.1007/s00165-004-0035-8openalex-snapshot
Completeness of a combination of neighbourhood logic and temporal logic
inferred← citeshttps://doi.org/10.1007/s001650050042openalex-snapshot
Hybrid Verifications of Reactive Programs
inferred← citeshttps://doi.org/10.1007/s002360050177openalex-snapshot
Verification of clocked and hybrid systems
inferred← citeshttps://doi.org/10.1007/s10990-007-9001-5openalex-snapshot
Semantics and pragmatics of Real-Time Maude
inferred← citeshttps://doi.org/10.1016/j.ic.2004.12.002openalex-snapshot
Timer formulas and decidable metric temporal logic
inferred← citeshttps://doi.org/10.1016/j.ic.2006.11.002openalex-snapshot
Temporal logics with incommensurable distances are undecidable
inferred← citeshttps://doi.org/10.1016/j.ic.2011.11.003openalex-snapshot
Continuous time temporal logic with counting
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.017openalex-snapshot
Complexity of metric temporal logics with counting and the Pnueli modalities
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00363-2openalex-snapshot
Specification of real-time and hybrid systems in rewriting logic
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)45970-2openalex-snapshot
Hybrid Systems Modelling and Validating Using Statecharts and Grafcet
inferred← citeshttps://doi.org/10.1023/a:1008129319165openalex-snapshot
Application of Partial-Order Methods to Reactive Programs with Event Memorization
inferred← citeshttps://doi.org/10.1023/a:1008700623084openalex-snapshot
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
inferred← citeshttps://doi.org/10.1023/a:1026585115440openalex-snapshot
Extending the SCR Method for Real-Time Systems
inferred← citeshttps://doi.org/10.1080/0952813031000119719openalex-snapshot
Formal verification of multi-agent systems behaviour emerging from cognitive task analysis
inferred← citeshttps://doi.org/10.1093/comjnl/bxm018openalex-snapshot
Service Availability in Concurrent Systems Part II: Analysis and Case Studies Using HSIP
inferred← citeshttps://doi.org/10.1109/cmpsac.1995.524757openalex-snapshot
A method for analyzing properties of hierarchical predicate transition nets
inferred← citeshttps://doi.org/10.1109/cmpsac.1997.624810openalex-snapshot
On the concurrent behaviour of SCR specifications
inferred← citeshttps://doi.org/10.1109/emwrts.1998.685073openalex-snapshot
Hidden time model for specification and verification of embedded systems
inferred← citeshttps://doi.org/10.1109/hcc.2001.995243openalex-snapshot
A timed automata semantics for real-time UML specifications
inferred← citeshttps://doi.org/10.1109/indin.2007.4384943openalex-snapshot
Sequential Axiomatic Model for Execution of Basic Function Blocks in IEC61499
inferred← citeshttps://doi.org/10.1109/isic.1995.525034openalex-snapshot
A deductive approach towards controller synthesis
inferred← citeshttps://doi.org/10.1142/9789812708472_0008openalex-snapshot
Verifying Real-Time Systems with Standard Tools
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:3)2007openalex-snapshot
Expressiveness of Metric modalities for continuous time
inferred← citeshttps://doi.org/10.25596/jalc-2000-371openalex-snapshot
Timed Automata with Periodic Clock Constraints
inferred← citeshttps://doi.org/10.3233/fi-1998-36236openalex-snapshot
Truth of Duration Calculus Formulae in Timed Frames
inferred← citeshttps://doi.org/10.5282/edoc.1819openalex-snapshot
Predicate Diagrams as Basis for the Verification of Reactive 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.