On the public citation graph

Forward and backward simulations for timing-based systems

https://doi.org/10.1007/bfb0032002

0 signed · 194 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.1064openalex-snapshot

Proving Nondeterministically Specified Safety Properties Using Progress Measures

inferredcites →https://doi.org/10.1007/3-540-15670-4_19openalex-snapshot

The ESTEREL synchronous programming language and its mathematical semantics

inferredcites →https://doi.org/10.1007/3-540-52559-9_71openalex-snapshot

On decomposing and refining specifications of distributed systems

inferredcites →https://doi.org/10.1007/3-540-52559-9_77openalex-snapshot

Multivalued possibilities mappings

inferredcites →https://doi.org/10.1007/3-540-52559-9_78openalex-snapshot

Completeness theorems for automata

inferredcites →https://doi.org/10.1007/3-540-54430-5_103openalex-snapshot

Time-constrained automata

inferredcites →https://doi.org/10.1007/3-540-54430-5_99openalex-snapshot

Simulations between specifications of distributed systems

inferredcites →https://doi.org/10.1007/3-540-55179-4_40openalex-snapshot

A linear time process algebra

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

Verifying hybrid systems

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

An approach to the description and analysis of hybrid 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/978-1-4612-0931-7openalex-snapshot

The Temporal Logic of Reactive and Concurrent Systems

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

An axiomatic proof technique for parallel programs I

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

From ATP to timed graphs and hybrid systems

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

A state-based approach to communicating processes

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

Process simulation and refinement

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

Real time process algebra

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

Using mappings to prove timing properties

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

Concurrency and automata on infinite sequences

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

Timed transition systems

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

From ATP to timed graphs and hybrid systems

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

A temporal calculus of communicating systems

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

Real-time behaviour of asynchronous agents

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

The silent step in time

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

Action transducers and timed automata

inferredcites →https://doi.org/10.1016/0020-0190(87)90224-9openalex-snapshot

Prespecification in data refinement

inferredcites →https://doi.org/10.1016/0020-0190(91)90061-lopenalex-snapshot

Proving correctness with respect to nondeterministic safety specifications

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(90)90076-popenalex-snapshot

Communication and concurrency

inferredcites →https://doi.org/10.1016/0304-3975(86)90007-1openalex-snapshot

Proving entailment between conceptual state specifications

inferredcites →https://doi.org/10.1016/0304-3975(88)90030-8openalex-snapshot

A timed model for communicating sequential processes

inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot

The existence of refinement mappings

inferredcites →https://doi.org/10.1016/c2013-0-08098-xopenalex-snapshot

Algebraic Theory of Automata

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

The temporal logic of actions

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

An old-fashioned recipe for real time

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

Hierarchical correctness proofs for distributed algorithms

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

Modular verification of asynchronous networks

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

Specifying Concurrent Program Modules

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

Using mappings to prove timing properties

inferredcites →https://doi.org/10.2307/2283757openalex-snapshot

The Art of Computer Programming. Volume 1: Fundamental Algorithms.

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.1006/inco.1997.2652openalex-snapshot

Quiescence, Fairness, Testing, and the Notion of Implementation

inferred← citeshttps://doi.org/10.1006/jcss.1998.1581openalex-snapshot

What's Decidable about Hybrid Automata?

inferred← citeshttps://doi.org/10.1007/11557432_10openalex-snapshot

Computing Refactorings of Behavior Models

inferred← citeshttps://doi.org/10.1007/11599555_33openalex-snapshot

Deductive Probabilistic Verification Methods of Safety, Liveness and Nonzenoness for Distributed Real-Time Systems

inferred← citeshttps://doi.org/10.1007/3-540-36108-1_7openalex-snapshot

Transformations of Self-Stabilizing Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-44880-2_19openalex-snapshot

Timed CSP and Object-Z

inferred← citeshttps://doi.org/10.1007/3-540-44929-9_39openalex-snapshot

A Single Complete Refinement Rule for Demonic Specifications

inferred← citeshttps://doi.org/10.1007/3-540-45927-8_20openalex-snapshot

Timing UDP: Mechanized Semantics for Sockets, Threads, and Failures

inferred← citeshttps://doi.org/10.1007/3-540-48256-3_18openalex-snapshot

From I/O Automata to Timed I/O Automata

inferred← citeshttps://doi.org/10.1007/3-540-48983-5_21openalex-snapshot

Refinement and Continuous Behaviour

inferred← citeshttps://doi.org/10.1007/3-540-56922-7_25openalex-snapshot

Computer-assisted simulation proofs

inferred← citeshttps://doi.org/10.1007/3-540-57208-2_23openalex-snapshot

Quiescence, fairness, testing, and the notion of implementation

inferred← citeshttps://doi.org/10.1007/3-540-58027-1_9openalex-snapshot

Timewise refinement for communicating processes

inferred← citeshttps://doi.org/10.1007/3-540-58201-0_66openalex-snapshot

Liveness in timed and untimed systems

inferred← citeshttps://doi.org/10.1007/3-540-58468-4_165openalex-snapshot

Verification of an audio control protocol

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_185openalex-snapshot

From physical modelling to compositional models of hybrid systems

inferred← citeshttps://doi.org/10.1007/3-540-60218-6_17openalex-snapshot

A compositional trace-based semantics for probabilistic automata

inferred← citeshttps://doi.org/10.1007/3-540-60218-6_28openalex-snapshot

A refinement theory that supports both ’decrease of nondeterminism’ and ’increase of parallelism’

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

HyTech: The Cornell Hybrid Technology Tool

inferred← citeshttps://doi.org/10.1007/3-540-61648-9_54openalex-snapshot

Compositionality in real-time shared variable concurrency

inferred← citeshttps://doi.org/10.1007/3-540-61769-8_1openalex-snapshot

How to build a highly available system using consensus

inferred← citeshttps://doi.org/10.1007/3-540-63010-4_4openalex-snapshot

Refinement of Time

inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_5openalex-snapshot

Abstractions from time

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-0-387-34878-0_19openalex-snapshot

Verifying Timing Properties of Concurrent Algorithms

inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_19openalex-snapshot

Implementation of multimedia systems based on a real-time extension of Estelle

inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_6openalex-snapshot

Rigorous specification of real-time systems

inferred← citeshttps://doi.org/10.1007/978-1-4471-3431-2_6openalex-snapshot

Real-Time and Safety-Critical Systems

inferred← citeshttps://doi.org/10.1007/978-1-4471-5355-9_13openalex-snapshot

Case Study: A Digital and Analogue Watch

inferred← citeshttps://doi.org/10.1007/978-1-4471-5355-9_8openalex-snapshot

A Single Simulation Rule

inferred← citeshttps://doi.org/10.1007/978-3-030-20652-9_19openalex-snapshot

Transaction Protocol Verification with Labeled Synchronization Logic

inferred← citeshttps://doi.org/10.1007/978-3-032-35298-9_19openalex-snapshot

Witnesses and Counterexamples for Timed Bisimulation

inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_7openalex-snapshot

An Automatic Technique for Checking the Simulation of Timed Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_19openalex-snapshot

Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-319-92711-4_2openalex-snapshot

Automata - Introducing Simulations

inferred← citeshttps://doi.org/10.1007/978-3-540-27764-4_13openalex-snapshot

Modelling Nondeterminism

inferred← citeshttps://doi.org/10.1007/978-3-540-27860-3_16openalex-snapshot

A Simple Testing Technique for Embedded Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-30121-9_18openalex-snapshot

Deductive Probabilistic Verification Methods for Embedded and Ubiquitous Computing

inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_15openalex-snapshot

Modeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-39979-7_12openalex-snapshot

Discrete Timed Automata and MONA: Description, Specification and Verification of a Multimedia Stream

inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_35openalex-snapshot

Probabilistic Simulations for Probabilistic Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_37openalex-snapshot

Composition and Behaviors of Probabilistic I/O Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_33openalex-snapshot

Can We Build an Automatic Program Verifier? Invariant Proofs and Other Challenges

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

Placement Inference for a Client-Server Calculus

inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_43openalex-snapshot

Safety Verification of an Aircraft Landing Protocol: A Refinement Approach

inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_37openalex-snapshot

Conditional Automata: A Tool for Safe Removal of Negligible Events

inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_19openalex-snapshot

On the Automated Implementation of Time-Based Paxos Using the IOA Compiler

inferred← citeshttps://doi.org/10.1007/978-3-642-21461-5_8openalex-snapshot

Relational Concurrent Refinement: Timed Refinement

inferred← citeshttps://doi.org/10.1007/978-3-642-30729-4_6openalex-snapshot

Refinement-Based Development of Timed Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-32332-4openalex-snapshot

Modeling Time in Computing

inferred← citeshttps://doi.org/10.1007/978-3-642-32332-4_7openalex-snapshot

Synchronous Abstract Machines

inferred← citeshttps://doi.org/10.1007/978-3-642-32355-3_10openalex-snapshot

An Event-B Approach to Timing Issues Applied to the Generic Insulin Infusion Pump

inferred← citeshttps://doi.org/10.1007/978-3-642-34032-1_15openalex-snapshot

Formal Analysis of TESLA Protocol in the Timed OTS/CafeOBJ Method

inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_14openalex-snapshot

A Proof-Based Method for Modelling Timed Systems

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

A comparison of simulation techniques and algebraic techniques for verifying concurrent systems

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

Action transducers and timed automata

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

Using mappings to prove timing properties

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

Verifying hybrid systems modeled as timed automata: A case study

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

Using an object-oriented methodology to bring a hybrid system from initial concept to formal definition

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

Weak refinement for modal hybrid systems

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

Probabilistic simulations for probabilistic processes

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

Verification of automated vehicle protection systems

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

Requirements specifications for hybrid systems

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/bfb0020971openalex-snapshot

Hybrid I/O automata

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

Distributed Algorithms

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

Efficient scaling-invariant checking of timed bisimulation

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

Proving safety properties of the steam boiler controller

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

Human-style theorem proving using PVS

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

Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study

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

Revisiting the Paxos algorithm

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

Trade-off results for connection management

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

Translation validation

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

Checking verifications of protocols and distributed systems by computer

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

At-most-once message delivery A case study in algorithm verification

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

Action transducers and timed automata

inferred← citeshttps://doi.org/10.1007/s00165-004-0034-9openalex-snapshot

Comparing model checking and logical reasoning for real-time systems

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

Composing and Refining Dense Temporal Logic Specifications

inferred← citeshttps://doi.org/10.1007/s00236-003-0129-4openalex-snapshot

Providing view synchrony for group communication services

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

Refinement of fair action systems

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

Transformational design of real-time systems. Part II: From program specifications to programs

inferred← citeshttps://doi.org/10.1007/s10270-006-0037-5openalex-snapshot

Computing refactorings of state machines

inferred← citeshttps://doi.org/10.1016/0164-1212(92)90045-lopenalex-snapshot

Formal methods for the specification and design of real-time safety critical systems

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

PVS Strategies for Proving Abstraction Properties of Automata

inferred← citeshttps://doi.org/10.1016/j.ipl.2005.05.012openalex-snapshot

Modularity for teams of I/O automata

inferred← citeshttps://doi.org/10.1016/j.scico.2006.01.007openalex-snapshot

Modelling angelic and demonic nondeterminism with multirelations

inferred← citeshttps://doi.org/10.1016/s0140-3664(98)00246-1openalex-snapshot

Towards the automatic generation of quality-of-service-preserving implementations from formal specifications

inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00016-0openalex-snapshot

Timewise refinement for communicating processes

inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00132-3openalex-snapshot

Formal methods for broadband and multimedia systems

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

Revisiting the paxos algorithm

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

Refinement of time

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

Deductive verification of real-time systems using STeP

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

Refinement and state machine abstraction

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00125-6openalex-snapshot

Trade-off results for connection management

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00229-0openalex-snapshot

A process algebra of communicating shared resources with dense time and priorities

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

Composition and behaviors of probabilistic I/O automata

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00239-4openalex-snapshot

Eventually-serializable data services

inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00067-1openalex-snapshot

Hybrid I/O automata

inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00025-5openalex-snapshot

Iterating transducers

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

The Essence of Coin Lemmas

inferred← citeshttps://doi.org/10.1023/a:1016320523091openalex-snapshot

Proving Invariants of I/O Automata with TAME

inferred← citeshttps://doi.org/10.1023/a:1018913028597openalex-snapshot

TAME: Using PVS strategies for special-purpose theorem proving

inferred← citeshttps://doi.org/10.1049/ip-cta:19960768openalex-snapshot

Error specification, monitoring andrecovery in computer-integratedmanufacturing: An analytic approach

inferred← citeshttps://doi.org/10.1090/dimacs/018/10openalex-snapshot

Atomic transactions for multiprocessor programming: A formal approach

inferred← citeshttps://doi.org/10.1093/comjnl/bxv057openalex-snapshot

A More Precise Implementation Relation for Distributed Testing

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

Reasoning about places, times, and actions in the presence of mobility

inferred← citeshttps://doi.org/10.1109/ase.2008.18openalex-snapshot

Validating Real Time Specifications using Real Time Event Queue Modeling

inferred← citeshttps://doi.org/10.1109/cdc.2004.1430238openalex-snapshot

Stability of hybrid automata with average dwell time: an invariant approach

inferred← citeshttps://doi.org/10.1109/cmpass.1994.318459openalex-snapshot

An ounce of prevention is worth a pound of cure. Towards physically-correct specifications of embedded real-time systems

inferred← citeshttps://doi.org/10.1109/hase.2000.895454openalex-snapshot

Automatic abstractions of real-time specifications

inferred← citeshttps://doi.org/10.1109/icse.2005.1553580openalex-snapshot

Real-time specification patterns

inferred← citeshttps://doi.org/10.1109/icsmc.1995.537906openalex-snapshot

Enhancing dependability of combat vehicles

inferred← citeshttps://doi.org/10.1109/isorc.2000.839515openalex-snapshot

Verification of UML-based real-time system designs by means of cTLA

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.1996.561342openalex-snapshot

The theory of hybrid automata

inferred← citeshttps://doi.org/10.1109/mascot.2009.5366667openalex-snapshot

Modeling and test generation for worst-case performance evaluation of MAC protocols for wireless ad hoc networks

inferred← citeshttps://doi.org/10.1109/memcod.2006.1695916openalex-snapshot

Specifying and proving properties of timed I/O automata in the TIOA toolkit

inferred← citeshttps://doi.org/10.1109/real.1992.242681openalex-snapshot

Timing-based mutual exclusion

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.1996.563701openalex-snapshot

Correctness of vehicle control systems-a case study

inferred← citeshttps://doi.org/10.1109/real.2003.1253264openalex-snapshot

Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems

inferred← citeshttps://doi.org/10.1109/sfcs.1995.492576openalex-snapshot

Computing simulations on finite and infinite graphs

inferred← citeshttps://doi.org/10.1109/tmc.2018.2812706openalex-snapshot

Viola: Trustworthy Sensor Notifications for Enhanced Privacy on Mobile Systems

inferred← citeshttps://doi.org/10.1109/vlsisoc.2011.6081620openalex-snapshot

State space optimization within the DEVS model of computation for timing efficiency

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

Safe compositional specification of networking systems

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

Engineering with logic

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

Rteq

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

Automatically transforming and relating Uppaal models of embedded systems

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

Using spreadsheets for finite state modelling

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

Designing algorithms for distributed systems with partially synchronized clocks

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

Safe compositional network sketches

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

Proving time bounds for randomized distributed algorithms

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

Journal Backlog Report

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

Formal verification of timed properties of randomized distributed algorithms

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

What's decidable about hybrid automata?

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

A menagerie of timed automata

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

Composition and refinement of discrete real-time systems

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

Ditio

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

Engineering with Logic

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

Classification schemes to aid in the analysis of real-time systems

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

Using TAME to prove invariants of automata models

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

Using mappings to prove timing properties

inferred← citeshttps://doi.org/10.14236/ewic/fa1997.16openalex-snapshot

Relaxing Property Preservation in the Refinement of Concurrent Systems

inferred← citeshttps://doi.org/10.1504/ijes.2006.014854openalex-snapshot

A survey of formal verification methods and tools for embedded and real-time systems

inferred← citeshttps://doi.org/10.2197/ipsjtrans.3.163openalex-snapshot

State and Threshold Sequence Minimization Algorithm of Linear Separation Automata

inferred← citeshttps://doi.org/10.2197/ipsjtrans.3.62openalex-snapshot

Theory of Minimizing Linear Separation Automata

inferred← citeshttps://doi.org/10.2200/s00006ed1v01y200508csl001openalex-snapshot

The Theory of Timed I/O Automata

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

TLB virtualization in the context of hypervisor verification

inferred← citeshttps://doi.org/10.3233/hsn-2005-257openalex-snapshot

Transformations of self-stabilizing algorithms

inferred← citeshttps://doi.org/10.48456/tr-624openalex-snapshot

TCP, UDP, and Sockets: rigorous and experimentally-validated behavioural specification Volume 1: Overview

inferred← citeshttps://doi.org/10.4995/thesis/10251/1886openalex-snapshot

Protocolos de pertenencia a grupos para entornos dinámicos

inferred← citeshttps://doi.org/10.71548/24573openalex-snapshot

Model Based System Consistency Checking Using Event-B

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.