On the public citation graph
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
0 signed · 444 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.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11205-7openalex-snapshot
Verifying Concurrent Processes Using Temporal Logic
inferredcites →https://doi.org/10.1007/3-540-16047-7_35openalex-snapshot
From state machines to temporal logic: Specification methods for protocol standards
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
inferredcites →https://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf01843567openalex-snapshot
A model and temporal proof system for networks of processes
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0036932openalex-snapshot
Proving precedence properties: The temporal way
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1016/0167-6423(83)90004-7openalex-snapshot
Proof rules and transformations dealing with fairness
inferredcites →https://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(81)90663-xopenalex-snapshot
A combinatorial approach to the theory of ω-automata
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1016/s0019-9958(84)80043-1openalex-snapshot
Can message buffers be axiomatized in linear temporal logic?
inferredcites →https://doi.org/10.1016/s0022-0000(75)80018-3openalex-snapshot
Proving assertions about parallel programs
inferredcites →https://doi.org/10.1109/tcom.1982.1095451openalex-snapshot
From State Machines to Temporal Logic: Specification Methods for Protocol Standards
inferredcites →https://doi.org/10.1109/tcom.1983.1095720openalex-snapshot
Modular Verification of Computer Communication Protocols
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1137/0213021openalex-snapshot
Verification of Probabilistic Programs
inferredcites →https://doi.org/10.1145/318593.318624openalex-snapshot
A model and temporal proof system for networks of processes
inferredcites →https://doi.org/10.1145/323596.323597openalex-snapshot
Concurrent programming for the masses (invited address)
inferredcites →https://doi.org/10.1145/323596.323600openalex-snapshot
On characterization of safety and liveness properties in temporal logic
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
inferredcites →https://doi.org/10.1145/512644.512661openalex-snapshot
Expressing interesting properties of programs in propositional temporal logic
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferredcites →https://doi.org/10.1145/800221.806721openalex-snapshot
Real-time programming and asynchronous message passing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470522622openalex-snapshot
UML 2 Semantics and Applications
inferred← citeshttps://doi.org/10.1002/9780470522622.ch12openalex-snapshot
Verification of UML Models
inferred← citeshttps://doi.org/10.1002/9780470522622.ch6openalex-snapshot
Axiomatic Semantics of UML Class Diagrams
inferred← citeshttps://doi.org/10.1002/9780470522622.ch8openalex-snapshot
Axiomatic Semantics of State Machines
inferred← citeshttps://doi.org/10.1002/smr.2439openalex-snapshot
F3FLUID: A formal framework for developing safety‐critical interactive systems in FLUID
inferred← citeshttps://doi.org/10.1006/inco.1999.2808openalex-snapshot
Testing Preorders for Probabilistic Processes
inferred← citeshttps://doi.org/10.1006/jvlc.1999.0127openalex-snapshot
A Visual and Formal Glue between Application and Interaction
inferred← citeshttps://doi.org/10.1007/11889229_5openalex-snapshot
Real-Time and Fault-Tolerant Systems
inferred← citeshttps://doi.org/10.1007/11914952_41openalex-snapshot
Aligning UML 2.0 State Machines and Temporal Logic for the Efficient Execution of Services
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_24openalex-snapshot
A modal logic for a subclass of event structures
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-37437-x_10openalex-snapshot
Parallelisierung, Nebenläufigkeit und alternative Modelle
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_5openalex-snapshot
Automated Refinement Checking for Asynchronous Processes
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_7openalex-snapshot
On Algorithms and Interaction
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_29openalex-snapshot
Abstraction-Based Model Checking Using Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_11openalex-snapshot
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_9openalex-snapshot
A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_21openalex-snapshot
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
inferred← citeshttps://doi.org/10.1007/3-540-46117-5_97openalex-snapshot
REFLIX: A Processor Core for Reactive Embedded Applications
inferred← citeshttps://doi.org/10.1007/3-540-46428-x_3openalex-snapshot
From Play-In Scenarios to Code: An Achievable Dream
inferred← citeshttps://doi.org/10.1007/3-540-47910-4_22openalex-snapshot
ObjChart: Tangible Specification of Reactive Object Behavior
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_35openalex-snapshot
Feature Interaction Detection Using Testing and Model-Checking Experience Report
inferred← citeshttps://doi.org/10.1007/3-540-48234-2_9openalex-snapshot
Analyzing Mode Confusion via Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-50302-1_9openalex-snapshot
Static analysis of real-time distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_28openalex-snapshot
A framework for the synthesis of reactive modules
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_35openalex-snapshot
Eliminating redundant interleavings during concurrent program verification
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_42openalex-snapshot
A method for refining atomicity in parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_35openalex-snapshot
Using temporal logic for prototyping: The design of a lift controller
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_16openalex-snapshot
On-line model-checking for finite linear temporal logic specifications
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_20openalex-snapshot
Automated verification of timed transition models
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_24openalex-snapshot
Requirement analysis for communication protocols
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_17openalex-snapshot
Specifying open distributed systems with Z
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_61openalex-snapshot
Refinement calculus, part II: Parallel and reactive programs
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_65openalex-snapshot
Modular verification of Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_71openalex-snapshot
On decomposing and refining specifications of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_75openalex-snapshot
Refinement and projection of relational specifications
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_81openalex-snapshot
Some comments on the assumption-commitment framework for compositional verification of distributed programs
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_52openalex-snapshot
Defining process fairness for non-interleaving concurrency
inferred← citeshttps://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_3openalex-snapshot
On the domain of traces and sequential composition
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_22openalex-snapshot
Temporal specifications of object behavior
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_11openalex-snapshot
Stepwise development of a distributed load balancing algorithm
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_46openalex-snapshot
On the faithfulness of formal models
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_53openalex-snapshot
Abstract dynamic data types: A temporal logic approach
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_111openalex-snapshot
Reduced labelled transition systems save verification effort
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_99openalex-snapshot
Simulations between specifications of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_1openalex-snapshot
ISL: An interval logic for the specification of real-time programs
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_11openalex-snapshot
Verification of a reliable net protocol
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_18openalex-snapshot
Scheduling in Real-Time Models
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_30openalex-snapshot
Stepwise development of model-oriented real-time specifications from action/event models
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_19openalex-snapshot
Bounded-memory algorithms for verification on-the-fly
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_44openalex-snapshot
An automata theoretic approach to Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_33openalex-snapshot
Algebraic specification of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_12openalex-snapshot
The abstract scheme for concurrent programming
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_54openalex-snapshot
Compositional state space generation
inferred← citeshttps://doi.org/10.1007/3-540-56777-1_30openalex-snapshot
Design of user-driven interfaces using Petri nets and objects
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_15openalex-snapshot
Concurrent MetateM — A language for modelling reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_7openalex-snapshot
A tool for symbolic program verification and abstraction
inferred← citeshttps://doi.org/10.1007/3-540-57209-0_19openalex-snapshot
Distributed information systems: An advanced methodology
inferred← citeshttps://doi.org/10.1007/3-540-57318-6_35openalex-snapshot
Models for hybrid systems: Automata, topologies, controllability, observability
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_16openalex-snapshot
Data-flow synchronous languages
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_29openalex-snapshot
Logical specifications of infinite computations
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_53openalex-snapshot
Methodology and system for practical formal verification of reactive hardware
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_6openalex-snapshot
Towards a semantics for concurrent MetateM
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_8openalex-snapshot
Towards first-order concurrent MetateM
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_229openalex-snapshot
Reactive system specification and refinement
inferred← citeshttps://doi.org/10.1007/3-540-60029-9_34openalex-snapshot
A Petri net based environment for the design of event-driven interfaces
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive systems
inferred← citeshttps://doi.org/10.1007/3540547428_47openalex-snapshot
Execution environment for ELECTRE applications
inferred← citeshttps://doi.org/10.1007/978-0-387-34907-7_13openalex-snapshot
Adding user interface to a behavioral specification
inferred← citeshttps://doi.org/10.1007/978-1-4471-3242-4_9openalex-snapshot
Completeness in Statechart Models for Reactive 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-4612-0325-4_21openalex-snapshot
Distributed Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4615-2303-1_1openalex-snapshot
Specification-Modeling Methodologies for Reactive-System Design
inferred← citeshttps://doi.org/10.1007/978-1-4615-3556-0_2openalex-snapshot
Formal Hardware Verification Methods: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5openalex-snapshot
Logics for Databases and Information Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_3openalex-snapshot
Temporal Logic in Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-46540-7_9openalex-snapshot
Characterizing Sets of Systems: Representation and Analysis of Across-Systems Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-85623-6_5openalex-snapshot
POISE: A Framework for Designing Perfect Interactive Systems with and for Imperfect People
inferred← citeshttps://doi.org/10.1007/978-3-030-98388-8_19openalex-snapshot
The Curriculum for Education in Engineering Interactive Systems at the Master in HCI of the University Toulouse III - Paul Sabatier
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_4openalex-snapshot
Efficient Loop Conditions for Bounded Model Checking Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_20openalex-snapshot
AP-Observation Automata for Abstraction-Based Verification of Continuous-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-32357-6_15openalex-snapshot
Verification of LTL Properties on Neural Networks for Chemical Process Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-319-04915-1_4openalex-snapshot
Improved Net Reductions for LTL$$\setminus $$X Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_25openalex-snapshot
A Game-Theoretic Approach to Simulation of Data-Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-17524-9_19openalex-snapshot
A Rigorous Approach to Combining Use Case Modelling and Accident Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-319-33693-0_25openalex-snapshot
Temporal Random Testing for Spark Streaming
inferred← citeshttps://doi.org/10.1007/978-3-319-51838-1_17openalex-snapshot
Exploiting Action Theory as a Framework for Analysis and Design of Formal Methods Approaches: Application to the CIRCUS Integrated Development Environment
inferred← citeshttps://doi.org/10.1007/978-3-319-51838-1_20openalex-snapshot
Dealing with Faults During Operations: Beyond Classical Use of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-92081-8_9openalex-snapshot
QBP Notation for Explicit Representation of Properties, Their Refinement and Their Potential Conflicts: Application to Interactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24756-2_8openalex-snapshot
State/Event-Based Software Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_2openalex-snapshot
A Compositional Semantics for Statecharts using Labeled Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73196-2_18openalex-snapshot
An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_20openalex-snapshot
Regular Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-88479-8_44openalex-snapshot
Static Partial-Order Reduction of Concurrent Systems in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_22openalex-snapshot
Regular Linear Temporal Logic with Past
inferred← citeshttps://doi.org/10.1007/978-3-642-12029-9_18openalex-snapshot
An Automata-Theoretic Approach to Hardware/Software Co-verification
inferred← citeshttps://doi.org/10.1007/978-3-642-13464-7_3openalex-snapshot
Reactive Semantics for Distributed UML Activities
inferred← citeshttps://doi.org/10.1007/978-3-642-24485-8_14openalex-snapshot
Engineering Android Applications Based on UML Activities
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_10openalex-snapshot
Parallelism, Concurrency, and Alternative Models
inferred← citeshttps://doi.org/10.1007/978-3-642-56478-9_59openalex-snapshot
The Turing Machine Paradigm in Contemporary Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_10openalex-snapshot
The Family of Concurrent Logic Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-84524-6_21openalex-snapshot
PROTEAN: A High-level Petri Net Tool for the Specification and Verification of Communication Protocols
inferred← citeshttps://doi.org/10.1007/978-3-7091-9396-9_23openalex-snapshot
Specification and Verification of Behavioral Patterns in Distributed Computations
inferred← citeshttps://doi.org/10.1007/978-3-7091-9472-0_2openalex-snapshot
Specifying navigational transformations in hypermedia. A temporal logic framework
inferred← citeshttps://doi.org/10.1007/978-3-7908-1840-6_8openalex-snapshot
Rough Set Methods for the Synthesis and Analysis of Concurrent Processes
inferred← citeshttps://doi.org/10.1007/978-94-010-0654-5_10openalex-snapshot
Domains of View: A Foundation for Specification and Analysis
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_8openalex-snapshot
Using Automated Theorem Provers in Verification of Protocols
inferred← citeshttps://doi.org/10.1007/978-981-15-1925-3_12openalex-snapshot
An Efficient Concurrent System Networking Protocol Specification and Verification Using Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/bf00121125openalex-snapshot
Formal hardware verification methods: A survey
inferred← citeshttps://doi.org/10.1007/bf00365462openalex-snapshot
A verifier for real-time properties
inferred← citeshttps://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferred← citeshttps://doi.org/10.1007/bf01211218openalex-snapshot
Compositional failure-based semantic models for Basic LOTOS
inferred← citeshttps://doi.org/10.1007/bf01245633openalex-snapshot
Functional specification and proof of correctness for time dependent behaviour of reactive systems
inferred← citeshttps://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferred← citeshttps://doi.org/10.1007/bf01407937openalex-snapshot
Fairness and the axioms of control predicates
inferred← citeshttps://doi.org/10.1007/bf01556348openalex-snapshot
A temporal logic-based approach for the description of object behavior evolution
inferred← citeshttps://doi.org/10.1007/bf01558665openalex-snapshot
Decentralization of process nets with centralized control
inferred← citeshttps://doi.org/10.1007/bf01887206openalex-snapshot
Event fairness and non-interleaving concurrency
inferred← citeshttps://doi.org/10.1007/bf01888226openalex-snapshot
Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems
inferred← citeshttps://doi.org/10.1007/bf01974953openalex-snapshot
A unified formal basis for the CASE tools system
inferred← citeshttps://doi.org/10.1007/bf02063809openalex-snapshot
Object-oriented specification and formal verification of real-time systems
inferred← citeshttps://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferred← citeshttps://doi.org/10.1007/bf02276639openalex-snapshot
Operational specification with joint actions: Serializable databases
inferred← citeshttps://doi.org/10.1007/bf02311231openalex-snapshot
P — A logic — a compositional proof system for distributed programs
inferred← citeshttps://doi.org/10.1007/bfb0012834openalex-snapshot
Propositional temporal interval logic is PSPACE complete
inferred← citeshttps://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferred← citeshttps://doi.org/10.1007/bfb0013032openalex-snapshot
An efficient verification method for parallel and distributed programs
inferred← citeshttps://doi.org/10.1007/bfb0013041openalex-snapshot
Computation tree logic and regular ω-languages
inferred← citeshttps://doi.org/10.1007/bfb0013075openalex-snapshot
From the past to the future: Executing temporal logic programs
inferred← citeshttps://doi.org/10.1007/bfb0013999openalex-snapshot
A temporal logic approach to implementation and refinement in timed Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0014002openalex-snapshot
A graph-based approach to resolution in temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0018487openalex-snapshot
The use of Ada in reactive systems: A 3-dimensional model
inferred← citeshttps://doi.org/10.1007/bfb0019819openalex-snapshot
Stepwise removal of virtual channels in distributed algorithms
inferred← citeshttps://doi.org/10.1007/bfb0023729openalex-snapshot
A stubborn attack on state explosion
inferred← citeshttps://doi.org/10.1007/bfb0024642openalex-snapshot
A metalanguage for the formal requirement specification of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0024669openalex-snapshot
Putting advanced reachability analysis techniques together: The “ARA” tool
inferred← citeshttps://doi.org/10.1007/bfb0027290openalex-snapshot
Integrating VDM++ and real-time system design
inferred← citeshttps://doi.org/10.1007/bfb0030596openalex-snapshot
Generalized quantitative temporal reasoning: An automata-theoretic approach
inferred← citeshttps://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferred← citeshttps://doi.org/10.1007/bfb0031991openalex-snapshot
Time in state based formal description techniques for distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0032008openalex-snapshot
Verification of safety critical systems using TTM/RTTL
inferred← citeshttps://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0032951openalex-snapshot
OAL: An implementation of an actor language on a massively parallel message-passing architecture
inferred← citeshttps://doi.org/10.1007/bfb0034774openalex-snapshot
Systems level specification and modelling of reactive systems: Concepts, methods, and tools
inferred← citeshttps://doi.org/10.1007/s00165-005-0071-zopenalex-snapshot
Concurrent software verification with states, events, and deadlocks
inferred← citeshttps://doi.org/10.1007/s00766-015-0242-2openalex-snapshot
Declaratively building behavior by means of scenario clauses
inferred← citeshttps://doi.org/10.1007/s00778-015-0390-5openalex-snapshot
Provenance-based analysis of data-centric processes
inferred← citeshttps://doi.org/10.1007/s10009-006-0021-yopenalex-snapshot
Some current topics in model checking
inferred← citeshttps://doi.org/10.1007/s10009-008-0089-7openalex-snapshot
Software model checking is a rich research field
inferred← citeshttps://doi.org/10.1007/s10270-007-0064-xopenalex-snapshot
A compositional semantics of UML-RSDS
inferred← citeshttps://doi.org/10.1007/s10515-006-0004-yopenalex-snapshot
On the effect of test-suite reduction on automatically generated model-based tests
inferred← citeshttps://doi.org/10.1007/s10703-005-1491-3openalex-snapshot
Translating Java for Multiple Model Checkers: The Bandera Back-End
inferred← citeshttps://doi.org/10.1007/s10703-006-0022-1openalex-snapshot
Verification of bounded Petri nets using integer programming
inferred← citeshttps://doi.org/10.1007/s10703-012-0181-1openalex-snapshot
Modeling and visualizing object-oriented programs with Codecharts
inferred← citeshttps://doi.org/10.1007/s11219-025-09729-0openalex-snapshot
CPD$$_{\textrm{LTLf}}$$ : a linear temporal logic over finite traces guided model checking tool
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90181-vopenalex-snapshot
Safety and liveness from a methodological point of view
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90005-gopenalex-snapshot
Sooner is safer than later
inferred← citeshttps://doi.org/10.1016/0096-0551(94)90011-6openalex-snapshot
RT-CDL: A distributed real-time design language and its operational semantics
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/0165-6074(87)90068-8openalex-snapshot
Reachability analysis -based validation of embedded systems
inferred← citeshttps://doi.org/10.1016/0165-6074(88)90154-8openalex-snapshot
PC-Rimst - a tool for validating concurrent program designs
inferred← citeshttps://doi.org/10.1016/0165-6074(89)90127-0openalex-snapshot
Mechanizing the verification of real-time discrete systems
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90272-bopenalex-snapshot
The specification and design of hard real-time systems using timed and temporal petri nets
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90381-gopenalex-snapshot
Verifying networks of processes that communicate via shared variables
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90069-popenalex-snapshot
Stepwise refinement of parallel algorithms
inferred← citeshttps://doi.org/10.1016/0169-7552(92)90109-4openalex-snapshot
Temporal logic and applications—a tutorial
inferred← citeshttps://doi.org/10.1016/0169-7552(92)90121-6openalex-snapshot
Formal definition and representation of interaction points
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90161-aopenalex-snapshot
On the interpretability of arithmetic in temporal logic
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90028-nopenalex-snapshot
Constraint logic programming for reasoning about discrete event processes
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1016/b978-0-08-041699-1.50015-xopenalex-snapshot
A real-time reactive model of control of an autonomous mobile robot
inferred← citeshttps://doi.org/10.1016/b978-0-08-041708-0.50012-xopenalex-snapshot
Verification of timing properties in a statecharts-based model of real-time reactive systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-408089-8.00004-5openalex-snapshot
Model-Driven Engineering of Reliable Fault-Tolerant Systems—A State-of-the-Art Survey
inferred← citeshttps://doi.org/10.1016/b978-0-444-82269-7.50025-3openalex-snapshot
MSCs to express Service Requirements as properties on a SDL model: Application to Service Interaction Detection11The work on this paper has been carried out in the RACE project SCORE, ref. 2017. It reflects the view of the authors.
showing the first 200 of 404 · page through all 404
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.