On the public citation graph
The anchored version of the temporal framework
0 signed · 200 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/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferredcites →https://doi.org/10.1007/bf01257083openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1007/bf01843567openalex-snapshot
A model and temporal proof system for networks of processes
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1007/bfb0036932openalex-snapshot
Proving precedence properties: The temporal way
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
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/0304-3975(85)90043-xopenalex-snapshot
A classification of ω-regular languages
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(82)91258-xopenalex-snapshot
Propositional dynamic logic of looping and converse is elementarily decidable
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
inferredcites →https://doi.org/10.1109/lics.1988.5115openalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
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.323600openalex-snapshot
On characterization of safety and liveness properties in temporal logic
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/359340.359353openalex-snapshot
Is “sometime” sometimes better than “always”?
inferredcites →https://doi.org/10.1145/41625.41626openalex-snapshot
Specification and verification of concurrent programs by A ∀ automata
inferredcites →https://doi.org/10.1145/41625.41628openalex-snapshot
Completeness and incompleteness of trace-based network proof systems
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
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/59287.62028openalex-snapshot
Verifying temporal properties without temporal logic
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.806716openalex-snapshot
Decentralization of process nets with centralized control
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.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferred← citeshttps://doi.org/10.1006/inco.1999.2817openalex-snapshot
Specification in CTL+Past for Verification in CTL
inferred← citeshttps://doi.org/10.1007/1-84628-271-3_8openalex-snapshot
Assuring the Behavior of Adaptive Agents
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
inferred← citeshttps://doi.org/10.1007/3-540-45484-5_37openalex-snapshot
Panel Discussion: “Future Directions”
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_1openalex-snapshot
Fully Abstract Characterization of Probabilistic May Testing
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-52559-9_71openalex-snapshot
On decomposing and refining specifications of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_86openalex-snapshot
Predicates, predicate transformers and refinement
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_49openalex-snapshot
A concurrent branching time temporal logic
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-53912-3_19openalex-snapshot
Experiences with combining formalisms in VVSL
inferred← citeshttps://doi.org/10.1007/3-540-53932-8_41openalex-snapshot
An introduction to modal and temporal logics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_126openalex-snapshot
Safety for branching time semantics
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-54430-5_89openalex-snapshot
The observation algebra of spatial pomsets
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_31openalex-snapshot
Formal specification of fault tolerant real time systems using minimal 3-sorted modal logic
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_39openalex-snapshot
Verifying properties of HMS machine specifications of real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_5openalex-snapshot
An action based framework for verifying logical and behavioural properties of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_67openalex-snapshot
Application of the composition principle to unity-like specifications
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_103openalex-snapshot
Temporal logic and categories of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_130openalex-snapshot
A hierarchy of temporal logics with past
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-58201-0_79openalex-snapshot
Reasoning about programs by exploiting the environment
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_176openalex-snapshot
Testing and refinement for nondeterministic and probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_10openalex-snapshot
Model checking of non-finite state processes by finite approximations
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_74openalex-snapshot
Selective quantitative analysis and interval model checking: Verifying different facets of a system
inferred← citeshttps://doi.org/10.1007/978-0-387-34869-8_13openalex-snapshot
Automated Testing of Safety Requirements with the Support of a Deductive Database
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_22openalex-snapshot
Formal Design of Cooperative Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_14openalex-snapshot
A formal method for event-triggered sequential systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_2openalex-snapshot
Modal Logics in Timed Process Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_33openalex-snapshot
On using a Composition Principle to Design Parallel Programs
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-3503-6_15openalex-snapshot
Concurrency, Fairness and Logical Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4615-4016-8_6openalex-snapshot
HMS Machines: A Unified Framework for Specification, Verification and Reasoning for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-65765-3_12openalex-snapshot
Combining the Temporal and Epistemic Dimensions for MTL Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_9openalex-snapshot
On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_5openalex-snapshot
The Safety-Progress Classification
inferred← citeshttps://doi.org/10.1007/978-3-642-61455-2_17openalex-snapshot
Notes on Proof Outline Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-02880-3_10openalex-snapshot
A Temporal Proof Methodology for Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-7091-2704-9_12openalex-snapshot
Object-Oriented Design of Information Systems: Troll Language Features
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_20openalex-snapshot
Model Checking ACTL Constrained Processes
inferred← citeshttps://doi.org/10.1007/978-94-017-1741-0_5openalex-snapshot
Coordinating Heterogeneous Components Using Executable Temporal Logic
inferred← citeshttps://doi.org/10.1007/bf00117599openalex-snapshot
Lattice structure of temporal interval relations
inferred← citeshttps://doi.org/10.1007/bf00121261openalex-snapshot
Automatic verification of distributed systems: The process algebra approach
inferred← citeshttps://doi.org/10.1007/bf01185559openalex-snapshot
An experience in proving regular networks of processes by modular model checking
inferred← citeshttps://doi.org/10.1007/bf01384048openalex-snapshot
Assisting requirement formalization by means of natural language translation
inferred← citeshttps://doi.org/10.1007/bf01384084openalex-snapshot
Model checking for action-based logics
inferred← citeshttps://doi.org/10.1007/bf01407838openalex-snapshot
Formal timing analysis of distributed systems
inferred← citeshttps://doi.org/10.1007/bf01887209openalex-snapshot
Automated analysis of mutual exclusion algorithms using CCS
inferred← citeshttps://doi.org/10.1007/bfb0000467openalex-snapshot
On the specification and verification of performance properties for a timed process algebra
inferred← citeshttps://doi.org/10.1007/bfb0014001openalex-snapshot
A hierarchy of partial order temporal properties
inferred← citeshttps://doi.org/10.1007/bfb0014324openalex-snapshot
A study on the specification and verification of performance properties
inferred← citeshttps://doi.org/10.1007/bfb0014430openalex-snapshot
Local specification of distributed families of sequential objects
inferred← citeshttps://doi.org/10.1007/bfb0022024openalex-snapshot
Activity threads: A unified framework for aiding behavioural modelling
inferred← citeshttps://doi.org/10.1007/bfb0024427openalex-snapshot
A dynamic specification of the RPC-memory problem
inferred← citeshttps://doi.org/10.1007/bfb0029625openalex-snapshot
Specification & verification of higher order processes
inferred← citeshttps://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferred← citeshttps://doi.org/10.1007/bfb0032058openalex-snapshot
Proving partial order liveness properties
inferred← citeshttps://doi.org/10.1007/bfb0033542openalex-snapshot
Analysis of autonomous Petri nets with bulk services and arrivals
inferred← citeshttps://doi.org/10.1007/bfb0037412openalex-snapshot
A deductive database support to the specification of concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0084784openalex-snapshot
Interface refinement in reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0084794openalex-snapshot
Propositional temporal logics and equivalences
inferred← citeshttps://doi.org/10.1007/bfb0084804openalex-snapshot
Timed Ethernet: Real-time formal specification of Ethernet
inferred← citeshttps://doi.org/10.1007/s00236-017-0307-4openalex-snapshot
Spanning the spectrum from safety to liveness
inferred← citeshttps://doi.org/10.1007/s10009-006-0006-xopenalex-snapshot
Model-checking the preservation of temporal properties upon feature integration
inferred← citeshttps://doi.org/10.1007/s10472-013-9356-8openalex-snapshot
Compositional reasoning using intervals and time reversal
inferred← citeshttps://doi.org/10.1007/s10703-006-0019-9openalex-snapshot
Bounded model checking of infinite state systems
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90007-iopenalex-snapshot
On undecidability of propositional temporal logics on trace systems
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00065-4openalex-snapshot
Logics and decidability for labelled pre- and partially ordered Kripke structures
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(89)90127-0openalex-snapshot
Mechanizing the verification of real-time discrete systems
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90237-4openalex-snapshot
The role of languages in the design-trajectory
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/0165-6074(94)90005-1openalex-snapshot
Automatic verification of distributed logic specifications
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90047-8openalex-snapshot
An action-based framework for veryfying logical and behavioural properties of concurrent systems
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)90183-gopenalex-snapshot
Local model checking for infinite state spaces
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00206-xopenalex-snapshot
On using temporal logic for refinement and compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot
Proving partial order properties
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90166-xopenalex-snapshot
A compositional framework for fault tolerance by specification transformation
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00035-uopenalex-snapshot
A hierarchy of temporal logics with past
inferred← citeshttps://doi.org/10.1016/b978-0-08-042237-4.50023-8openalex-snapshot
COMPARING RTL AND FNLOG- TIMING PROPERTIES IN REAL-TIME SYSTEMS
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.019openalex-snapshot
Model-checking the Preservation of Temporal Properties upon Feature Integration
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.030openalex-snapshot
Decision Procedures for a Deontic Logic Modeling Temporal Inheritance of Obligations
inferred← citeshttps://doi.org/10.1016/j.ins.2006.03.008openalex-snapshot
A user-friendly interface to specify temporal properties of concurrent systems
inferred← citeshttps://doi.org/10.1016/j.jal.2009.02.001openalex-snapshot
Deontic action logic, atomic boolean algebras and fault-tolerance
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00104-0openalex-snapshot
Reasoning about nondeterministic and concurrent actions: A process algebra approach
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00038-7openalex-snapshot
A rely–guarantee discipline for open distributed systems design
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00130-2openalex-snapshot
Infinitary relations and their representation
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00028-7openalex-snapshot
Verification of XTP context management closing procedure in style of TLA
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00308-xopenalex-snapshot
Axioms for real-time logics
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00044-5openalex-snapshot
Testing preorders for probabilistic processes can be characterized by simulations
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00165-xopenalex-snapshot
Specification of abstract dynamic-data types: A temporal logic approach
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00008-0openalex-snapshot
Verification of reactive systems using temporal logic with clocks
inferred← citeshttps://doi.org/10.1016/s0736-5845(96)00015-4openalex-snapshot
Specification and design of logic controllers for automated manufacturing systems
inferred← citeshttps://doi.org/10.1016/s0947-3580(97)70077-3openalex-snapshot
Petri Nets for the Design and Operation of Manufacturing Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)45760-0openalex-snapshot
Comparing RTL and FNLOG- timing properties in real-time systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80548-6openalex-snapshot
A Branching Time Logical System for Open Distributed Systems Development
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80472-4openalex-snapshot
Specification in CTL+Past, Verification in CTL
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1023/a:1008713601998openalex-snapshot
Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System
inferred← citeshttps://doi.org/10.1023/a:1026585115440openalex-snapshot
Extending the SCR Method for Real-Time Systems
inferred← citeshttps://doi.org/10.1080/095281399146634openalex-snapshot
Removing irrelevant information in temporal resolution proofs
inferred← citeshttps://doi.org/10.1080/11663081.1996.10510865openalex-snapshot
Automated deduction in a graphical temporal logic
inferred← citeshttps://doi.org/10.1080/11663081.2000.10510998openalex-snapshot
Temporal Logics with Reference Pointers and Computation Tree Logics
inferred← citeshttps://doi.org/10.1093/logcom/exm006openalex-snapshot
Using Temporal Logic to Analyse Temporal Logic: A Hierarchical Approach Based on Intervals
inferred← citeshttps://doi.org/10.1093/logcom/exn002openalex-snapshot
A Syntactical Proof of the Canonical Reactivity Form for Past Linear Temporal Logic
inferred← citeshttps://doi.org/10.1109/37.56283openalex-snapshot
A logic for real-time discrete event processes
inferred← citeshttps://doi.org/10.1109/37.56284openalex-snapshot
Concurrency and discrete event control
inferred← citeshttps://doi.org/10.1109/acc.2016.7525009openalex-snapshot
Symbolic construction of GR(1) contracts for systems with full information
inferred← citeshttps://doi.org/10.1109/cmpeur.1991.257366openalex-snapshot
Verifying networks of processes that synchronize via shared variables
inferred← citeshttps://doi.org/10.1109/edac.1993.386409openalex-snapshot
Specification and verification of system-level hardware designs using time diagrams
inferred← citeshttps://doi.org/10.1109/eurdac.1993.410626openalex-snapshot
An efficient tool for system-level verification of behaviors and temporal properties
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617347openalex-snapshot
TLA-style specification of a mobile network
inferred← citeshttps://doi.org/10.1109/fscs.1990.89589openalex-snapshot
Tight bounds on the complexity of cascaded decomposition of automata
inferred← citeshttps://doi.org/10.1109/ftdcs.1992.217513openalex-snapshot
A logical model of cooperation
inferred← citeshttps://doi.org/10.1109/icdcs.1989.37949openalex-snapshot
Verifying finite state real-time discrete event processes
inferred← citeshttps://doi.org/10.1109/icde.1992.213153openalex-snapshot
History-less checking of dynamic integrity constraints
inferred← citeshttps://doi.org/10.1109/issre.1994.341361openalex-snapshot
Temporal complexity and software faults
inferred← citeshttps://doi.org/10.1109/jcit.1990.128356openalex-snapshot
An interleaving model for real-time
inferred← citeshttps://doi.org/10.1109/jcit.1990.128359openalex-snapshot
A temporal proof methodology for reactive systems
inferred← citeshttps://doi.org/10.1109/lics.1990.113764openalex-snapshot
Real-time logics: complexity and expressiveness
inferred← citeshttps://doi.org/10.1109/lics.1991.151648openalex-snapshot
Specifying and proving serializability in temporal logic
inferred← citeshttps://doi.org/10.1109/lics.1991.151651openalex-snapshot
Specification and refinement of probabilistic processes
inferred← citeshttps://doi.org/10.1109/lics.1995.523277openalex-snapshot
Compositional testing preorders for probabilistic processes
inferred← citeshttps://doi.org/10.1109/memcod.2004.1459809openalex-snapshot
Bounded model checking of infinite state systems: exploiting the automata hierarchy
inferred← citeshttps://doi.org/10.1109/real.1989.63560openalex-snapshot
Real-time temporal logic decision procedures
inferred← citeshttps://doi.org/10.1109/tencon.1991.729671openalex-snapshot
A Temporal Logic over Partial Orders for Analysis of Real-Time Properties of Distributed Programs
inferred← citeshttps://doi.org/10.1109/time.2011.25openalex-snapshot
Compositional Reasoning Using Intervals and Time Reversal
inferred← citeshttps://doi.org/10.1137/0330077openalex-snapshot
Information Structures, Causality, and Nonsequential Stochastic Control I: Design-Independent Properties
inferred← citeshttps://doi.org/10.1142/s0218194003001494openalex-snapshot
A PROCEDURE TO TRANSLATE PARADIGM SPECIFICATIONS TO PROPOSITIONAL LINEAR TEMPORAL LOGIC AND ITS APPLICATION TO VERIFICATION
inferred← citeshttps://doi.org/10.1145/123041.123059openalex-snapshot
A real-time transition model for analyzing behavioral compatibility of telecommunications services
inferred← citeshttps://doi.org/10.1145/125083.123059openalex-snapshot
A real-time transition model for analyzing behavioral compatibility of telecommunications services
inferred← citeshttps://doi.org/10.1145/174662.174665openalex-snapshot
Compositional specification and verification of distributed systems
inferred← citeshttps://doi.org/10.1145/210197.210200openalex-snapshot
Efficient checking of temporal integrity constraints using bounded history encoding
inferred← citeshttps://doi.org/10.1145/2462410.2462423openalex-snapshot
Privacy promises that can be kept
inferred← citeshttps://doi.org/10.1145/568760.568847openalex-snapshot
A temporal logic view of paradigm models
inferred← citeshttps://doi.org/10.1145/93385.93425openalex-snapshot
A decidable temporal logic to reason about many processes
inferred← citeshttps://doi.org/10.1145/93385.93429openalex-snapshot
Half-order modal logic: how to prove real-time properties
inferred← citeshttps://doi.org/10.1145/99583.99629openalex-snapshot
Temporal proof methodologies for real-time systems
inferred← citeshttps://doi.org/10.1155/2011/869182openalex-snapshot
Towards Support for Software Model Checking: Improving the Efficiency of Formal Specifications
inferred← citeshttps://doi.org/10.3390/a7030339openalex-snapshot
Model Checking Properties on Reduced Trace Systems
inferred← citeshttps://doi.org/10.4204/eptcs.202.6openalex-snapshot
A multi-paradigm language for reactive synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601008openalex-snapshot
A Hierarchical Analysis of Propositional Temporal Logic Based on Intervals
inferred← citeshttps://doi.org/10.7250/9789934226748openalex-snapshot
Model-Oriented Control in Intelligent Manufacturing Systems
inferred← citeshttps://doi.org/10.82444/warw.33803119openalex-snapshot
A temporal logic for the specification and verification of real-time 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.