Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
Reads0
Chats0
TLDR
A star-free version of propositional dynamic logic (PDL) with loop and converse is introduced and it is shown that first-order logic over MSCs has the three-variable property.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2021-02-01 and is currently open access. It has received 3 citations till now. The article focuses on the topics: Dynamic logic (modal logic) & First-order logic.read more
Citations
More filters
Proceedings ArticleDOI
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages
TL;DR: It is shown that every LocPastPDL formula can be computed by a restricted local cascade product of the gossip automaton and localized 2-state asynchronous reset automata and localized asynchronous permutation automata.
Proceedings ArticleDOI
From Graphs to the Science Computer of a Space Telescope - The Power of Petri Nets in Systems Engineering
Rafal Graczyk,Waldemar Bujwan,Marcin Darmetko,Marcin Dzieżyc,Damien Galano,Konrad Grochowski,Michal Kurowski,G. Juchnikowski,M. Morawski,Michał Mosdorf,Piotr Orleanski,Cédric Thizy,Marcus Völp +12 more
TL;DR: The paper elaborates on how the proposed Petri-Net-modeling scheme allows for system architecture optimization that result in safely reduced technical margins and in turn substantial savings in components costs.
Journal ArticleDOI
Using Codes of Output Collections for Hardware Reduction in Circuits of LUT-Based Finite State Machines
TL;DR: In this article , a structural decomposition method is proposed to reduce the number of look-up table (LUT) elements in FSM circuits compared to the three-block FSM circuit.
References
More filters
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Book
Distributed algorithms
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Journal ArticleDOI
Propositional dynamic logic of regular programs
TL;DR: A formal syntax and semantics for the propositional dynamic logic of regular programs is defined and principal conclusions are that deciding satisfiability of length n formulas requires time d n /log n for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c.