Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2020.06.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3042689394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and Branching Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of verifying message passing programs under bounded asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating Finite-State Machines and Two-Variable Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Muller message-passing automata and logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional Dynamic Logic for Message-Passing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message-passing automata are expressively equivalent to EMSO logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of 2-Stack Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On notions of regularity for data languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous mappings and asynchronous cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure future local temporal logics are expressively complete for Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Concurrent Time-Stamping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modalities for model checking: Branching time logic strikes back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3504344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kleene theorem and model checking algorithms for existentially bounded communicating automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PDL with intersection and converse: satisfiability and infinite-state model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On logics with two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak models of distributed computing, with connections to modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to completeness and complexity for modal logics of knowledge and belief / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of regular MSC languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular sets of infinite message sequence charts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Logic and Distributed Message Passing Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking propositional dynamic logic with all extras / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Exp Time lower bounds for propositional dynamic logics with intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded MSC communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded time-stamping in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keeping track of the latest gossip in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Message-Passing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Graph Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expressively complete linear time temporal logic for Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 22:40, 23 July 2024

scientific article
Language Label Description Also known as
English
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
scientific article

    Statements

    Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (English)
    0 references
    0 references
    0 references
    0 references
    23 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    communicating finite-state machines
    0 references
    first-order logic
    0 references
    happened-before relation
    0 references
    propositional dynamic logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references