3 citations · 4 across the 6 of their papers we have counts for
7 papers · 1 filter
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
Benedikt Bollig, Marie Fortin, Paul Gastin
Message sequence charts (MSCs) visually represent interactions in distributed systems that communicate through FIFO channels. High-level MSCs (HMSCs) extend MSCs with choice, conca…
Reachability for Updatable Timed Automata made faster and more effective
Paul Gastin, Sayan Mukherjee, B Srivathsan
Updatable timed automata (UTA) are extensions of classic timed automata that allow special updates to clock variables, like x:= x - 1, x := y + 2, etc., on transitions. Reachabilit…
Timed Systems through the Lens of Logic
S. Akshay, Paul Gastin, Vincent Juge +1
In this paper, we analyze timed systems with data structures, using a rich interplay of logic and properties of graphs. We start by describing behaviors of timed systems using grap…
Reachability in timed automata with diagonal constraints
Paul Gastin, Sayan Mukherjee, B Srivathsan
We consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enu…
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"
Benedikt Bollig, Marie Fortin, Paul Gastin
Message sequence charts (MSCs) naturally arise as executions of communicating finite-state machines (CFMs), in which finite-state processes exchange messages through unbounded FIFO…
Communicating Finite-State Machines and Two-Variable Logic
Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating finite-state machines are a fundamental, well-studied model of finite-state processes that communicate via unbounded first-in first-out channels. We show that they ar…