On the public citation graph
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
0 signed · 144 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-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/bf00289519openalex-snapshot
Hierarchical ordering of sequential processes
inferredcites →https://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferredcites →https://doi.org/10.1007/bfb0022461openalex-snapshot
Modal logic of concurrent nondeterministic programs
inferredcites →https://doi.org/10.1007/bfb0022469openalex-snapshot
On the absence of livelocks in parallel programs
inferredcites →https://doi.org/10.1007/bfb0022535openalex-snapshot
Deadlocks and livelocks in transition systems
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
inferredcites →https://doi.org/10.1016/0304-3975(84)90103-8openalex-snapshot
Fair termination revisited—with delay
inferredcites →https://doi.org/10.1016/s0019-9958(85)80014-0openalex-snapshot
A proof rule for fair termination of guarded commands
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119005223.ch7openalex-snapshot
Formal Methods Applied to Gene Network Modeling
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_17openalex-snapshot
On structural properties of generalized processes
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_174openalex-snapshot
Communication with concurrent systems via I/0-procedures
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_4openalex-snapshot
Expressive Power of Temporal Logics
inferred← citeshttps://doi.org/10.1007/3-540-45828-x_1openalex-snapshot
Embedded Systems: Challenges in Specification and Verification
inferred← citeshttps://doi.org/10.1007/3-540-48166-4_31openalex-snapshot
Checking Progress with Action Priority: Is it Fair?
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_8openalex-snapshot
Verification of Temporal Properties of Processes in a Setting with Data
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_39openalex-snapshot
Deciding the path- and word-fair equivalence problem
inferred← citeshttps://doi.org/10.1007/3-540-50580-6_30openalex-snapshot
On questions of fairness and temporal logic for conflict-free Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_21openalex-snapshot
An expressive logic for a process algebra with silent actions
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_14openalex-snapshot
CCS, liveness, and local model checking in the linear time mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_23openalex-snapshot
What are the limits of model checking methods for the verification of real life protocols?
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_113openalex-snapshot
On proving properties of completion strategies
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_106openalex-snapshot
Fairness in models with true concurrency
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_22openalex-snapshot
Formal Specification of a Framework for Groupware Development
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-3-030-50029-0_23openalex-snapshot
Combining SLiVER with CADP to Analyze Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-76384-8_16openalex-snapshot
Verification of Eventual Consensus in Synod Using a Failure-Aware Actor Model
inferred← citeshttps://doi.org/10.1007/978-3-030-89159-6_29openalex-snapshot
Verifying Temporal Properties of Stigmergic Collective Systems Using CADP
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_8openalex-snapshot
Compositional Verification of Stigmergic Collective Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-50524-9_10openalex-snapshot
Solving Two-Player Games Under Progress Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-78709-6_5openalex-snapshot
A Decremental Algorithm for Fair Büchi Games
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_7openalex-snapshot
Attractor Equivalence: An Observational Semantics for Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-97643-3_7openalex-snapshot
Catastrophic Cyber-Physical Malware
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_14openalex-snapshot
Reasoning About Systems with Transition Fairness
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_31openalex-snapshot
Computing Meta-transitions for Linear Transition Systems with Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_12openalex-snapshot
A Model Checking Language for Concurrent Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot
The Birth of Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_5openalex-snapshot
Not All Fair Probabilistic Schedulers Are Equivalent
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_11openalex-snapshot
State/Event-Based LTL Model Checking under Parametric Generalized Fairness
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_11openalex-snapshot
Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31739-2_8openalex-snapshot
Verification and Analysis of Autonomic Systems for Networked Enterprises
inferred← citeshttps://doi.org/10.1007/978-3-642-35743-5_17openalex-snapshot
Verifying Safety of Fault-Tolerant Distributed Components
inferred← citeshttps://doi.org/10.1007/978-3-642-79789-7_8openalex-snapshot
Failure Mode Assumptions and Assumption Coverage
inferred← citeshttps://doi.org/10.1007/bf00121125openalex-snapshot
Formal hardware verification methods: A survey
inferred← citeshttps://doi.org/10.1007/bf00264283openalex-snapshot
The instability of self-stabilization
inferred← citeshttps://doi.org/10.1007/bf01211296openalex-snapshot
A methodology for designing proof rules for fair parallel programs
inferred← citeshttps://doi.org/10.1007/bf01383965openalex-snapshot
The implicit set paradigm: A new approach to finite state system verification
inferred← citeshttps://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferred← citeshttps://doi.org/10.1007/bfb0013123openalex-snapshot
A characterization of fair computations of finite state SCCS processes
inferred← citeshttps://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0015773openalex-snapshot
A complete compositional modal proof system for a subset of CCS
inferred← citeshttps://doi.org/10.1007/bfb0017158openalex-snapshot
A taxonomy of fairness and temporal logic problems for petri nets
inferred← citeshttps://doi.org/10.1007/bfb0023716openalex-snapshot
Verifying temporal properties of sequential machines without building their state diagrams
inferred← citeshttps://doi.org/10.1007/bfb0026307openalex-snapshot
On the existence of fair schedulers
inferred← citeshttps://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferred← citeshttps://doi.org/10.1007/bfb0035859openalex-snapshot
An automaton characterization of fairness in SCCS
inferred← citeshttps://doi.org/10.1007/bfb0039621openalex-snapshot
Some results on fairness: The regular case
inferred← citeshttps://doi.org/10.1007/s00165-016-0362-6openalex-snapshot
Verification of EB3 specifications using CADP
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s00779-012-0536-zopenalex-snapshot
An algorithm on fairness verification of mobile sink routing in wireless sensor network
inferred← citeshttps://doi.org/10.1007/s100090050012openalex-snapshot
Protocol verification with the ALDÉBARAN toolset
inferred← citeshttps://doi.org/10.1007/s11334-022-00463-5openalex-snapshot
Eventual consensus in Synod: verification using a failure-aware actor model
inferred← citeshttps://doi.org/10.1007/s11704-013-3091-5openalex-snapshot
Model checking with fairness assumptions using PAT
inferred← citeshttps://doi.org/10.1016/0164-1212(96)00027-1openalex-snapshot
A unified framework for the specification and run-time detection of dynamic properties in distributed computations
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90066-uopenalex-snapshot
Verification of concurrent programs: the automata-theoretic framework*
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90048-9openalex-snapshot
VESAR: a pragmatic approach to formal specification and verification
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90066-xopenalex-snapshot
Ten years of Hoare's logic: A survey— part II: Nondeterminism
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90034-4openalex-snapshot
An algebraic and algorithmic method for analysing transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90126-5openalex-snapshot
An introduction to the regular theory of fairness
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90053-4openalex-snapshot
Problems concerning fairness and temporal logic for conflict-free petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90206-hopenalex-snapshot
Global and local views of state fairness
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90228-topenalex-snapshot
A taxonomy of fairness and temporal logic problems for Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90175-fopenalex-snapshot
Strong fairness and ultra metrics
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00136-7openalex-snapshot
Compilation of the ELECTRE reactive language into finite transition systems
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferred← citeshttps://doi.org/10.1016/b978-044482816-3/50032-0openalex-snapshot
ObjectInterconnecting the GEODE and CÆSAR-Aldébaran toolsets
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.036openalex-snapshot
Transparent First-class Futures and Distributed Components
inferred← citeshttps://doi.org/10.1016/j.ic.005.07.006openalex-snapshot
BTL 2 and the expressive power of ECTL
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.006openalex-snapshot
BTL2 and the expressive power of ECTL+
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.03.008openalex-snapshot
Generating non-conspiratorial executions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.100964openalex-snapshot
Fair termination of multiparty sessions
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.08.007openalex-snapshot
Model checking a cache coherence protocol of a Java DSM implementation
inferred← citeshttps://doi.org/10.1016/j.scico.2013.01.003openalex-snapshot
Formal analysis of a hardware dynamic task dispatcher with CADP
inferred← citeshttps://doi.org/10.1016/j.scico.2014.04.004openalex-snapshot
Property-dependent reductions adequate with divergence-sensitive branching bisimilarity
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.006openalex-snapshot
Arity hierarchy for temporal logics
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80052-2openalex-snapshot
A fresh look at free choice nets
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00038-6openalex-snapshot
On the verification of qualitative properties of probabilistic processes under fairness constraints
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00034-2openalex-snapshot
Specification and verification of various distributed leader election algorithms for unidirectional ring networks
inferred← citeshttps://doi.org/10.1051/ita/1989230100591openalex-snapshot
Fairness and regularity for SCCS processes
inferred← citeshttps://doi.org/10.1051/ita/1989230100591/pdfopenalex-snapshot
Fairness and regularity for SCCS processes
inferred← citeshttps://doi.org/10.1108/ftrob-05-2025-0083openalex-snapshot
Formal methods in robot end user development: progress, gaps, and opportunities
inferred← citeshttps://doi.org/10.1109/5.24143openalex-snapshot
Petri nets: Properties, analysis and applications
inferred← citeshttps://doi.org/10.1109/easic.1990.207991openalex-snapshot
The formal verification chain at BULL
inferred← citeshttps://doi.org/10.1109/edac.1990.136620openalex-snapshot
Formal Boolean manipulations for the verification of sequential machines
inferred← citeshttps://doi.org/10.1109/ftcs.1992.243562openalex-snapshot
Failure mode assumptions and assumption coverage
inferred← citeshttps://doi.org/10.1109/icse.1992.753504openalex-snapshot
A Toolbox For The Verification Of LOTOS Programs
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213433openalex-snapshot
Model checking a cache coherence protocol for a Java DSM implementation
inferred← citeshttps://doi.org/10.1109/time.2016.12openalex-snapshot
Verify LTL with Fairness Assumptions Efficiently
inferred← citeshttps://doi.org/10.1145/1244002.1244324openalex-snapshot
Analysis and verification of an automatic document feeder
inferred← citeshttps://doi.org/10.1145/2038642.2038686openalex-snapshot
Model-checking behavioral programs
inferred← citeshttps://doi.org/10.1145/318593.318620openalex-snapshot
Modalities for model checking (extended abstract)
inferred← citeshttps://doi.org/10.1145/318774.319268openalex-snapshot
Checking progress with action priority
inferred← citeshttps://doi.org/10.1145/3388218.3388222openalex-snapshot
Analyzing Cyber-Physical Systems from the Perspective of Artificial Intelligence
inferred← citeshttps://doi.org/10.1145/3475964openalex-snapshot
Design and Deployment of Expressive and Correct Web of Things Applications
inferred← citeshttps://doi.org/10.1145/4904.4993openalex-snapshot
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
inferred← citeshttps://doi.org/10.1145/800057.808708openalex-snapshot
A general result on infinite trees and its applications
inferred← citeshttps://doi.org/10.1177/0142331208095571openalex-snapshot
A study on fairness of place/transition systems-to make fairness fairer
inferred← citeshttps://doi.org/10.1515/intag-2015-0084openalex-snapshot
Effect of composition on physical properties of food powders
inferred← citeshttps://doi.org/10.20381/ruor-16648openalex-snapshot
Guided search technique for LOTOS.
inferred← citeshttps://doi.org/10.2200/s00328ed1v01y201101dct006openalex-snapshot
New Models for Population Protocols
inferred← citeshttps://doi.org/10.29007/slnnopenalex-snapshot
Model Check What You Can, Runtime Verify the Rest
inferred← citeshttps://doi.org/10.3166/tsi.22.461-495openalex-snapshot
Logiques temporelles basées sur actions pour la vérification des systèmes asynchrones
inferred← citeshttps://doi.org/10.32657/10356/147268openalex-snapshot
Automatic program analysis and verification and their applications in smart contracts
inferred← citeshttps://doi.org/10.3990/1.9789090130866openalex-snapshot
Analysing industrial protocols with formal methods
inferred← citeshttps://doi.org/10.5555/949970.949984openalex-snapshot
Formal Boolean manipulations for the verification of sequential machines
inferred← citeshttps://doi.org/10.70675/1b0bfe3bzfe7bz4748za9a1zc38ebd508e3fopenalex-snapshot
Parity games and reachability in infinite-state systems with parameters
inferred← citeshttps://doi.org/10.70675/d1caf044zc911z4c99zb1abz73004313c32copenalex-snapshot
Models and Verification for Composition and Reconfiguration of Web of Things Applications
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.