Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Behavioral Equivalence"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Games and Economic Behavior. 121:533-547
Two extensive game structures with imperfect information are said to be behaviorally equivalent if they share the same map (up to relabelings) from profiles of structurally reduced strategies to induced terminal paths. We show that this is the case i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4c3aef5e037fc89c85436391f23d6b3
https://doi.org/10.1016/j.geb.2019.11.009
https://doi.org/10.1016/j.geb.2019.11.009
Autor:
Cesco, Arnaldo, Gorrieri, Roberto
Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which are a well-known Turing-complete, distributed model of computation, are equipped with a decidable, behavioral equivalence, called pti-place bisimilarity, that conservatively
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1dd53e46ab8c27e441fd71d477056d03
Autor:
Cesco A., Gorrieri R.
We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for finite bounded Petri nets. The proofs are based on a generalization of the ordered marking proof technique that Vogler used to demonstrate that (strong
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4094::047b94b730de5d9312b2b24d01f56e38
https://hdl.handle.net/11585/849455
https://hdl.handle.net/11585/849455
Autor:
Daniela Petrişan, Alexandre Goy
Publikováno v:
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.454-464, ⟨10.1145/3373718.3394795⟩
LICS
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.454-464, ⟨10.1145/3373718.3394795⟩
LICS
International audience; Combining probabilistic choice and non-determinism is a long standing problem in denotational semantics. From a category theory perspective, the problem stems from the absence of a distributive law of the powerset monad over t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40a0eab878a4a1fc5a7878146457c268
https://hal.archives-ouvertes.fr/hal-02564365/file/probabilityandnondeterminism.pdf
https://hal.archives-ouvertes.fr/hal-02564365/file/probabilityandnondeterminism.pdf
Autor:
Roberto Gorrieri
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 96:65-80
Finite-state machines, a simple class of finite Petri nets, are equipped with a truly concurrent, bisimulation-based, behavioral equivalence, called team equivalence, which conservatively extends classic bisimulation equivalence over labeled transiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3156958b0395900e2899d1df062b5c8
https://doi.org/10.1016/j.jlamp.2017.11.005
https://doi.org/10.1016/j.jlamp.2017.11.005
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
George Voutsadakis
Publikováno v:
Bulletin of the Section of Logic. 45
Babenyshev and Martins proved that two hidden multi-sorted deductive systems are deductively equivalent if and only if there exists an isomorphism between their corresponding lattices of theories that commutes with substitutions. We show that the π-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5c54679035c1679d0d09b0b086a2694
https://doi.org/10.18778/0138-0680.45.2.04
https://doi.org/10.18778/0138-0680.45.2.04
Autor:
Sergey Babenyshev, Manuel A. Martins
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
This work advances a research agenda which has as its main aim the application of Abstract Algebraic Logic (AAL) methods and tools to the specification and verification of software systems. It uses a generalization of the notion of an abstract dedu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e36bc19d6f16d6841e4794b888f631ab