scientific article; zbMATH DE number 557977
From MaRDI portal
Publication:4289659
Recommendations
- scientific article; zbMATH DE number 1292294
- Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
- Finite and infinite implementation of transition systems
- Publication:4734770
- scientific article; zbMATH DE number 1735648
- scientific article; zbMATH DE number 515733
- On the transitivity of finite dimensional systems
- scientific article; zbMATH DE number 4080929
- scientific article; zbMATH DE number 4108166
- A transition system semantics for the control-driven coordination language MANIFOLD
Cited in
(56)- Failure-equivalent transformation of transition systems to avoid internal actions
- A general theory of action languages
- An algebraic characterization of observational equivalence
- On the rational behaviors of concurrent timers
- On temporal logic versus Datalog
- Scheduling hard sporadic tasks with regular languages and generating functions.
- Weak confluence and \(\tau\)-inertness
- Nivat's processes and their synchronization
- Bisimulation indexes and their applications
- Timed-pNets: a communication behavioural semantic model for distributed systems
- Factorisation of transition systems
- Approximate analyzing of labeled transition systems
- Finite and infinite implementation of transition systems
- Control-invariance of hybrid systems with forcible events
- On constructibility and unconstructibility of LTS operators from other LTS operators
- Weighted automata and weighted logics
- WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
- Bisimulation for labelled Markov processes
- Comparing cospan-spans and tiles via a Hoare-style process calculus
- Coinduction in concurrent timed systems
- A Markovian concurrency measure
- A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
- Weighted Automata and Weighted Logics with Discounting
- A pseudometric in supervisory control of probabilistic discrete event systems
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- scientific article; zbMATH DE number 3976320 (Why is no real title available?)
- Compatibility in a multi-component environment
- scientific article; zbMATH DE number 139604 (Why is no real title available?)
- Projection approaches to process mining using region-based techniques
- scientific article; zbMATH DE number 515733 (Why is no real title available?)
- Modal Logic, Transition Systems and Processes
- scientific article; zbMATH DE number 2079818 (Why is no real title available?)
- How expressions can code for automata
- Construction and Analysis of Transition Systems with MEC
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Order-theoretic Trees: Monadic Second-order Descriptions and Regularity
- Verification and comparison of transition systems
- Weighted automata and weighted logics
- Symbolic timing devices
- Automatic Verification of Bossa Scheduler Properties
- The LTS workbench
- Fixing Zeno gaps
- An overview of synchronous communication for control of decentralized discrete-event systems
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings
- A survey on compositional algorithms for verification and synthesis in supervisory control
- Unfoldings and Coverings of Weighted Graphs
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Articulation of Transition Systems and Its Application to Petri Net Synthesis
- Reaction Systems, Transition Systems, and Equivalences
- Mind the gap: expanding communication options in decentralized discrete-event control
- Coupling asynchrony and interrupts: Place Chart Nets
- Timed non-interference under partial observability and bounded memory
- The monadic second-order logic of graphs. IX: Machines and their behaviours
- On regular trees defined from unfoldings and coverings
- Weighted automata and weighted logics with discounting
- Supervisory control of \((\max,+)\) automata: a behavioral approach
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289659)
