Cover Image

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bollig, Benedikt, Fortin, Marie, Gastin, Paul
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
by: Bollig, Benedikt
Published: (2026)

Verification of Neural Networks (Lecture Notes)
by: Bollig, Benedikt
Published: (2026)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)

Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)

Message complexity for unary multiautomata systems
by: Choffrut, Christian
Published: (2024)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
by: Lin, Yi, et al.
Published: (2024)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)

Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)

DTMC Model Checking by Path Abstraction Revisited (extended version)
by: Hartmanns, Arnd, et al.
Published: (2025)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)

Rethinking meaning and ontologies from the perspective of ontological units
by: Fabry, Paul, et al.
Published: (2025)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Taking Complete Finite Prefixes To High Level, Symbolically
by: Würdemann, Nick, et al.
Published: (2023)

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

Unreliability in Practical Subclasses of Communicating Systems
by: Suresh, Amrita, et al.
Published: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
by: Di Giusto, Cinzia, et al.
Published: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
by: Fatmi, Syyeda Zainab, et al.
Published: (2025)

Learning Verified Monitors for Hidden Markov Models
by: van der Maas, Luko, et al.
Published: (2025)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
by: Ho, Hsi-Ming, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

The termination of Nielsen transformations applied to word equations with length constraints
by: Przybocki, Benjamin, et al.
Published: (2025)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
by: Barbaro, Luca, et al.
Published: (2025)

Extended CTG Generalization and Dynamic Adjustment of Generalization Strategies in IC3
by: Su, Yuheng, et al.
Published: (2025)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
by: Holík, Lukáš, et al.
Published: (2025)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

Automating the Analysis of Quantitative Automata with QuAK
by: Chalupa, Marek, et al.
Published: (2025)